Transitive closures of binary relations II.
Transitive closures of binary relations. III.
Transitive closures of binary relations. IV.
Transitive decomposition of fuzzy preference relations: the case of nilpotent minimum
Transitivity is a fundamental notion in preference modelling. In this work we study this property in the framework of additive fuzzy preference structures. In particular, we depart from a large preference relation that is transitive w.r.t. the nilpotent minimum t-norm and decompose it into an indifference and strict preference relation by means of generators based on t-norms, i. e. using a Frank t-norm as indifference generator. We identify the strongest type of transitivity these indifference and...
Transitive Properties of Ideals on Generalized Cantor Spaces
We compute transitive cardinal coefficients of ideals on generalized Cantor spaces. In particular, we show that there exists a null set such that for every null set we can find such that A ∪ (A+x) cannot be covered by any translation of B.
Transitive ternary relations and quasiorderings
Translation of nonstandard definitions to standard ones
Travaux publiés par les membres du groupe «théories stables»
Tree Automata and Automata on Linear Orderings
We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second order theory of the infinite binary tree [9].
Trees, inverse systems, and valuated vector spaces
Triangular norm-based addition preserving linearity of T-sums of linear fuzzy intervals.
The addition of fuzzy intervals based on a triangular norm T is studied. It is shown that the addition based on a t-norm T weaker than the Lukasiewicz t-norm TL acts on linear fuzzy intervals just as the TL-based addition. Some examples are given.
Triangular solutions of Boolean equations.
Triangulation in o-minimal fields with standard part map
In answering questions of J. Maříková [Fund. Math. 209 (2010)] we prove a triangulation result that is of independent interest. In more detail, let R be an o-minimal field with a proper convex subring V, and let st: V → k be the corresponding standard part map. Under a mild assumption on (R,V) we show that a definable set X ⊆ Vⁿ admits a triangulation that induces a triangulation of its standard part st X ⊆ kⁿ.
TTL : a formalism to describe local and global properties of distributed systems
Turning Borel sets into clopen sets effectively
We present the effective version of the theorem about turning Borel sets in Polish spaces into clopen sets while preserving the Borel structure of the underlying space. We show that under some conditions the emerging parameters can be chosen in a hyperarithmetical way and using this we obtain some uniformity results.
T-Varieties and Clones of T-terms
The aim of this paper is to describe how varieties of algebras of type τ can be classified by using the form of the terms which build the (defining) identities of the variety. There are several possibilities to do so. In [3], [19], [15] normal identities were considered, i.e. identities which have the form x ≈ x or s ≈ t, where s and t contain at least one operation symbol. This was generalized in [14] to k-normal identities and in [4] to P-compatible identities. More generally, we select a subset...
Twin prime problem in an arithmetic without induction
Two applications of analytic topologies.
Two Axiomatizations of Nelson Algebras
Nelson algebras were first studied by Rasiowa and Białynicki- Birula [1] under the name N-lattices or quasi-pseudo-Boolean algebras. Later, in investigations by Monteiro and Brignole [3, 4], and [2] the name “Nelson algebras” was adopted - which is now commonly used to show the correspondence with Nelson’s paper [14] on constructive logic with strong negation. By a Nelson algebra we mean an abstract algebra 〈L, T, -, ¬, →, ⇒, ⊔, ⊓〉 where L is the carrier, − is a quasi-complementation (Rasiowa used...
Two cases when and are equal
We deal with two cardinal invariants and give conditions on their equality using Shelah's pcf theory.