Topologies compatible with ordering
Topologies corresponding to metrics on -groups
Topologies in -groups
Topology and axioms of interpolation in partially ordered spaces.
Topology on regulators of lattice ordered groups. I. Topology induced by an -group
Topology on regulators of lattice ordered groups. II: Completely regular regulators
Torsion classes and subdirect products of Carathéodory vector lattices
Torsion classes and torsion prime selectors of -groups
Torsion classes of Specker lattice ordered groups
In this paper we investigate the relations between torsion classes of Specker lattice ordered groups and torsion classes of generalized Boolean algebras.
Torsion radicals of lattice ordered groups
Torsion theory for lattice-ordered groups
Torsion theory for lattice-ordered groups Part II: Homogeneous -groups
Totally inhomogeneous lattice ordered groups
Totally ordered archimedean semigroups.
Towards a theory of noncommutative lattices.
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...
Translation-invariant function algebras on compact abelian groups.
Treillis d'idéaux et structure d'anneaux
T-topologies on a lattice ordered group.
In this paper a characterization of the topologies on a l-group arising from a CTRO (T-topologies) is given. We use it to find conditions under which the Redfield topology comes from a CTRO.
Two Kinds of Invariance of Full Conditional Probabilities
Let G be a group acting on Ω and ℱ a G-invariant algebra of subsets of Ω. A full conditional probability on ℱ is a function P: ℱ × (ℱ∖{∅}) → [0,1] satisfying the obvious axioms (with only finite additivity). It is weakly G-invariant provided that P(gA|gB) = P(A|B) for all g ∈ G and A,B ∈ ℱ, and strongly G-invariant provided that P(gA|B) = P(A|B) whenever g ∈ G and A ∪ gA ⊆ B. Armstrong (1989) claimed that weak and strong invariance are equivalent, but we shall show that this is false and that weak...