Search results for "Transitive relation"

showing 10 items of 74 documents

Transitive partially hyperbolic diffeomorphisms on 3-manifolds

2005

Abstract The known examples of transitive partially hyperbolic diffeomorphisms on 3-manifolds belong to 3 basic classes: perturbations of skew products over an Anosov map of T 2 , perturbations of the time one map of a transitive Anosov flow, and certain derived from Anosov diffeomorphisms of the torus T 3 . In this work we characterize the two first types by a local hypothesis associated to one closed periodic curve.

Discrete mathematicsTransitive relationPure mathematicsMathematics::Dynamical Systems010102 general mathematics05 social sciencesSkewTorus01 natural sciencesMathematics::Geometric TopologyFlow (mathematics)Structural stability0502 economics and businessAnosov diffeomorphismGeometry and Topology0101 mathematicsMathematics::Symplectic Geometry050203 business & managementMathematicsTopology
researchProduct

Transitive Reasoning with Imprecise Probabilities

2015

We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent \(\text{ p-consistent }\) sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Finally, we present the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases.

Discrete mathematicsTransitive relationSettore MAT/06 - Probabilita' E Statistica MatematicaSettore INF/01 - Informaticabusiness.industryProbabilistic logicSyllogismInferenceCoherence (philosophical gambling strategy)Settore M-FIL/02 - Logica E Filosofia Della ScienzaComputer Science::Artificial IntelligenceImprecise probabilityCoherence default imprecise probability knowledge base p-consistency p-entailment reasoning syllogism weak transitivityProbability propagationKnowledge basebusinessMathematics
researchProduct

The fluted fragment with transitive relations

2022

Abstract The fluted fragment is a fragment of first-order logic (without equality) in which, roughly speaking, the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that this fragment has the finite model property. We consider extensions of the fluted fragment with various numbers of transitive relations, as well as the equality predicate. In the presence of one transitive relation (together with equality), the finite model property is lost; nevertheless, we show that the satisfiability and finite satisfiability problems for this extension remain decidable. We also show that the corresponding problems in the…

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTransitivityTransitive relationLogicFinite model propertyF.4.1; F.2.2DecidabilityExtension (predicate logic)SatisfiabilityLogic in Computer Science (cs.LO)DecidabilityUndecidable problemFluted logicCombinatoricsFragment (logic)03D15F.4.1Order (group theory)F.2.2SatisfiabilityMathematicsAnnals of Pure and Applied Logic
researchProduct

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants

2018

We consider extensions of the two-variable guarded fragment, GF2, where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, pre-orders or partial orders). We prove that the only fragment that retains the finite (exponential) model property is GF2 with equivalence guards without equality. For remaining fragments we show that the size of a minimal finite model is at most doubly exponential. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NExpTime-upper bou…

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTwo-variable logicGeneral Computer ScienceComputational complexity theoryLogicguarded fragmentBinary number0102 computer and information sciences01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatoricstransitive relationEquivalence relationfinite satisfiability problem0101 mathematicsEquivalence (formal languages)Integer programmingMathematicsDiscrete mathematicsTransitive relationNEXPTIMEcomputational complexity010102 general mathematicsLogic in Computer Science (cs.LO)Computational Mathematics010201 computation theory & mathematicsequivalence ralationACM Transactions on Computational Logic
researchProduct

An Empirical Study of the Relation Between Community Structure and Transitivity

2012

One of the most prominent properties in real-world networks is the presence of a community structure, i.e. dense and loosely interconnected groups of nodes called communities. In an attempt to better understand this concept, we study the relationship between the strength of the community structure and the network transitivity (or clustering coefficient). Although intuitively appealing, this analysis was not performed before. We adopt an approach based on random models to empirically study how one property varies depending on the other. It turns out the transitivity increases with the community structure strength, and is also affected by the distribution of the community sizes. Furthermore, …

FOS: Computer and information sciencesPhysics - Physics and SocietyProperty (philosophy)FOS: Physical sciencesPhysics and Society (physics.soc-ph)[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]01 natural sciencesComplex NetworksClustering010305 fluids & plasmasEmpirical research0103 physical sciences010306 general physicstransitivityCommunity StructureClustering coefficientMathematicsSocial and Information Networks (cs.SI)Transitive relationCommunity structure[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Computer Science - Social and Information NetworksComplex networkDegree distributionZero (linguistics)Mathematical economics
researchProduct

On finite soluble groups in which Sylow permutability is a transitive relation

2003

A characterisation of finite soluble groups in which Sylow permutability is a transitive relation by means of subgroup embedding properties enjoyed by all the subgroups is proved in the paper. The key point is an extension of a subnormality criterion due to Wielandt.

Finite groupTransitive relationGeneral MathematicsSylow theoremsGrups Teoria deExtension (predicate logic)CombinatoricsMathematics::Group TheoryKey pointLocally finite groupPermutabilitySubnormalityEmbeddingÀlgebraFinite groupAlgebra over a fieldMATEMATICA APLICADAMathematicsActa Mathematica Hungarica
researchProduct

On generalised FC-groups in which normality is a transitive relation

2016

We extend to soluble FC∗ -groups, the class of generalised FC-groups introduced in [F. de Giovanni, A. Russo, G. Vincenzi, Groups with restricted conjugacy classes , Serdica Math. J. 28(3) (2002), 241 254], the characterisation of finite soluble T-groups obtained recently in [G. Kaplan, On T-groups, supersolvable groups and maximal subgroups , Arch. Math. 96 (2011), 19 25].

General Mathematicsmedia_common.quotation_subject0102 computer and information sciencesFC-group01 natural sciencesCombinatoricsT-groupT-groupFC-groupmedia_common.cataloged_instance0101 mathematicsAlgebra over a fieldEuropean unionNormalityMathematicsmedia_commonTransitive relationPronormal subgroup010102 general mathematicsGrups Teoria dePronormal subgroup010201 computation theory & mathematicsT-group FC-group pronormal subgroupÀlgebraMATEMATICA APLICADA
researchProduct

Transitivity prominence within and across modalities

2020

The idea of transitivity as a scalar phenomenon is well known (e.g., Hopper & Thompson 1980; Tsunoda 1985; Haspelmath 2015). However, as with most areas of linguistic study, it has been almost exclusively studied with a focus on spoken languages. A rare exception to this is Kimmelman (2016), who investigates transitivity in Russian Sign Language (RSL) on the basis of corpus data. Kimmelman attempts to establish a transitivity prominence hierarchy of RSL verbs, and compares this ranking to the verb meanings found in the ValPal database (Hartmann, Haspelmath & Bradley 2013). He arrives at the conclusion that using the frequency of overt objects in corpus data is a successful measure o…

Linguistics and LanguageComputer sciencekorpuslingvistiikkacorpus linguisticsvalenssi (kielitiede)P1-1091VerbSign languageLanguage and LinguisticsvalencyviittomakieliCorpus linguisticstransitivitysign languagesPhilology. LinguisticsModality (semiotics)transitiivisuus (kielitiede)signed languagesSign Language LinguisticsGeneral Language Studies and LinguisticsTransitive relationHierarchykielitiedeJämförande språkvetenskap och allmän lingvistikLocative caseLanguage & CommunicationLinguisticstypologiattypologySign (mathematics)
researchProduct

La elección del caso pronominal en dos corpus orales puertorriqueños

2014

Esta investigación tiene por objeto un estudio contrastivo del uso de los pronombres átonos (clíticos) en dos corpus orales de Puerto Rico que corresponden a dos generaciones distintas. Ya que este país es uno de los distinguidores de caso, resulta especialmente interesante conocer con qué verbos y en qué estructuras se documentan ambos casos o se ve favorecido el dativo en lugar del acusativo, con el fin de comprobar si existen factores específicos que condicionan la elección del pronombre. Para ello, abordamos el uso de los clíticos de tercera persona  en verbos o construcciones transitivas y de caso reinterpretado.DOI http://dx.doi.org/10.15304/verba.41.1667

Linguistics and LanguageTransitive relationThird personOrder (business)media_common.quotation_subjectDative caseArtCartographyLanguage and LinguisticsLinguisticsmedia_commonVerba: Anuario Galego de Filoloxía
researchProduct

The fluted fragment revisited

2019

AbstractWe study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, motivated by the work of W. V. Quine. We show that the satisfiability problem for this fragment has nonelementary complexity, thus refuting an earlier published claim by W. C. Purdy that it is in NExpTime. More precisely, we consider ${\cal F}{{\cal L}^m}$, the intersection of the fluted fragment and the m-variable fragment of first-order logic, for all $m \ge 1$. We show that, for $m \ge 2$, this subfragment forces $\left\lfloor {m/2} \right\rfloor$-tuply exponentially large models, and that its satisfiability problem is $\left\lfloor {m/2} \right\rfloor$-NExpTime-hard. We…

Logic0102 computer and information sciencesQuine01 natural sciences68Q17Fragment (logic)0101 mathematicstransitivityMathematicsfirst-order logicDiscrete mathematicsTransitive relationNEXPTIME010102 general mathematicsdecidabilityfluted fragmentSatisfiabilityDecidabilityFirst-order logicPhilosophysatisfiability010201 computation theory & mathematicssatisfabilityBoolean satisfiability problemcomplexityJournal of Symbolic Logic
researchProduct