In this contribution, the transitivity property of commutative first-order linear timevarying systems is investigated with and without initial conditions. It is proven that transitivity property of first-order systems holds with and without initial conditions. On the base of impulse response function, transitivity of commutation property is formulated for any triplet of commutative linear time-...

Let $$G=(V, E)$$ be a graph where V and E are the vertex edge sets, respectively. For two disjoint subsets A B, we say dominates B if every of is adjacent to at least one A. partition $$\pi = \{V_1, V_2, \ldots , V_k\}$$ G called transitive k-partition $$V_i$$ $$V_j$$ for all i, j $$1\le i<j\le k$$ . The maximum integer k which above exists transitivity it denoted by Tr(G). Maximum Transitivity...

Transitivity in trust is very often considered as a quite simple property, trivially inferable from the classical transitivity defined in mathematics, logic, or grammar. In fact the complexity of the trust notion suggests evaluating the relationships with the transitivity in a more adequate way. In this paper, starting from a socio-cognitive model of trust, we analyze the different aspects and ...

Transitivity is a very important property in order to provide coherence to a preference relation. Usually, t-norms are considered to define the transitivity of fuzzy relations. In this paper we deal with conjunctors, a wider family than t-norm, to define the transitivity. This more general definition allows to impove the results found in the literature. We characterize the behaviour with respec...

This paper describes an ongoing study which applies the concept of transitivity to news discourse for text processing tasks. The complex notion of transitivity is defined and the relationship between transi-tivity and information foregrounding is explained. A sample corpus of news articles has been coded for transitivity. The corpus is being used in two text processing experiments .

Let f:X?X be a continuous map on compact metric space X and let ?f, ?f ICTf denote the set of ?-limit sets, ?-limit sets nonempty closed internally chain transitive respectively. In this paper we characterise, by introducing novel variants shadowing, maps for which every element is equal to (resp. may approximated by) same full trajectory. We construct examples highlighting difference between t...

The main goal of this paper is the investigation of a relevant property which appears in the various definition of deterministic topological chaos for discrete time dynamical system: transitivity. Starting from the standard Devaney’s notion of topological chaos based on regularity, transitivity, and sensitivity to the initial conditions, the critique formulated by Knudsen is taken into account ...

The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of t...