Search results for "transitive"
showing 10 items of 98 documents
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
Lexical classes and constructions: an analysis of the constructional realization of entity-specific change-of-state English verbs
2013
This study analyzes a so far neglected part of the constructional behavior of Levin's (1993) entity-specific change-of-state verbs. More specifically, we discuss the integration of verbs from this lexical class into the intransitive-resultative construction. We base our analysis on the Lexical Constructional Model or LCM (Ruiz de Mendoza and Mairal 2008, 2011; Mairal and Ruiz de Mendoza 2009; Ruiz de Mendoza 2013). It will be shown that the internal and external constraints postulated by the LCM constitute useful explanatory and analytical tools for the fusion processes between these verbs and the intransitive-resultative construction. We also propose a classification of these verbs on the …
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…
The guarded fragment with transitive guards
2004
The guarded fragment with transitive guards, (GF+TG), is an extension of the guarded frag- ment of 9rst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quanti9ers and the equality symbol may appear everywhere. We prove that the decision problem for (GF+TG) is decidable. Moreover, we show that the problem is in 2EXPTIME. This result is optimal since the satis9ability problem for GF is 2EXPTIME-complete (J. Symbolic Logic 64 (1999) 1719-1742). We also show that the satis- 9ability problem for two-variable (GF+TG) is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satis9ability …
A new definition of well-behaved discrimination functions
2009
Abstract A discrimination function shows the probability or degree with which stimuli are discriminated from each other when presented in pairs. In a previous publication [Kujala, J.V., & Dzhafarov, E.N. (2008). On minima of discrimination functions. Journal of Mathematical Psychology , 52 , 116–127] we introduced a condition under which the conformity of a discrimination function with the law of Regular Minimality (which says, essentially, that “being least discriminable from” is a symmetric relation) implies the constancy of the function’s minima (i.e., the same level of discriminability of every stimulus from the stimulus least discriminable from it). This condition, referred to as “well…
On finite T-groups
2003
[EN] Characterisations of finite groups in which normality is a transitive relation are presented in the paper. We also characterise the finite groups in which every subgroup is either permutable or coincides with its permutiser as the groups in which every subgroup is permutable.
How Correlated Are Community-Aware and Classical Centrality Measures in Complex Networks?
2021
Unlike classical centrality measures, recently developed community-aware centrality measures use a network’s community structure to identify influential nodes in complex networks. This paper investigates their relationship on a set of fifty real-world networks originating from various domains. Results show that classical and community-aware centrality measures generally exhibit low to medium correlation values. These results are consistent across networks. Transitivity and efficiency are the most influential macroscopic network features driving the correlation variation between classical and community-aware centrality measures. Additionally, the mixing parameter, the modularity, and the Max…
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations
2009
We show that every finitely satisfiable two-variable first-order formula with two equivalence relations has a model of size at most triply exponential with respect to its length. Thus the finite satisfiability problem for two-variable logic over the class of structures with two equivalence relations is decidable in nondeterministic triply exponential time. We also show that replacing one of the equivalence relations in the considered class of structures by a relation which is only required to be transitive leads to undecidability. This sharpens the earlier result that two-variable logic is undecidable over the class of structures with two transitive relations.
Attracteurs de Lorenz de variété instable de dimension arbitraire
1997
Abstract We construct the first examples of flows with robust multidimensional Lorenz-like attractors: the singularity contained in the attractor may have any number of expanding eigenvalues, and the attractor remains transitive in a whole neighbourhood of the initial flow. These attractors support a Sinai-Ruelle-Bowen SRB-measure and, contrary to the usual (low-dimensional) Lorenz models, they have infinite modulus of structural stability.
Some Characterisations of Soluble SST-Groups
2016
All groups considered in this paper are finite. A subgroup H of a group G is said to be SS-permutable or SS-quasinormal in G if H has a supplement K in G such that H permutes with every Sylow subgroup of K. Following [6], we call a group G an SST-group provided that SS-permutability is a transitive relation in G, that is, if A is an SS-permutable subgroup of B and B is an SS-permutable subgroup of G, then A is an SS-permutable subgroup of G. The main aim of this paper is to present several characterisations of soluble SST-groups.