Tolerante Catalanzahlen
Torsion groupoids
Total Algebras and Weak Independence. I.
Total Algebras and Weak Independence. II.
Toward ternary C
In which the binary product algebra of complex numbers, C, is generalized to a ternary product algebra, .
Transferable principal congruences and regular algebras
Transferral of entailment in duality theory: dualisability
A number of new results that say how to transfer the entailment relation between two different finite generators of a quasi-variety of algebras is presented. As their consequence, a well-known result saying that dualisability of a quasi-variety is independent of the generating algebra is derived. The transferral of endodualisability is also considered and the results are illustrated by examples.
Transferral of entailment in duality theory II: strong dualisability
Results saying how to transfer the entailment in certain minimal and maximal ways and how to transfer strong dualisability between two different finite generators of a quasi-variety of algebras are presented. A new proof for a well-known result in the theory of natural dualities which says that strong dualisability of a quasi-variety is independent of the generating algebra is derived.
Transformation semigroup diagram and the ...-relation.
Transitive closures of binary relations. I.
Transitive closures of binary relations II.
Transitive closures of binary relations. IV.
Transitively acting monoids of local automorphisms of locally finite trees
Transitivity, Associativity and Bisymmetry eputations on GD- goupoids.
Transitivity, Associativity And Bisymmetry Equations On GD-Groupoids
Transitivity of principal tolerances is not a Mal'cev property
Trapezoid lemma and congruence distributivity
Tree transformations defined by hypersubstitutions
Tree transducers are systems which transform trees into trees just as automata transform strings into strings. They produce transformations, i.e. sets consisting of pairs of trees where the first components are trees belonging to a first language and the second components belong to a second language. In this paper we consider hypersubstitutions, i.e. mappings which map operation symbols of the first language into terms of the second one and tree transformations defined by such hypersubstitutions....
Trees, band monoids, and formal languages.
Turning retractions of an algebra into an algebra.