Abstract
By a commutative term we mean an element of the free commutative groupoid F of infinite rank. For two commutative terms a, b write a ⩽ b if b contains a subterm that is a substitution instance of a. With respect to this relation, F is a quasiordered set which becomes an ordered set after the appropriate factorization. We study definability in this ordered set. Among other things, we prove that every commutative term (or its block in the factor) is a definable element. Consequently, the ordered set has no automorphisms except the identity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Ježek: The lattice of equational theories. Part I: Modular elements. Czechoslovak Math. J. 31 (1981), 127–152.
J. Ježek: The lattice of equational theories. Part II: The lattice of full sets of terms. Czechoslovak Math. J. 31 (1981), 573–603.
J. Ježek: The lattice of equational theories. Part III: Definability and automorphisms. Czechoslovak Math. J. 32 (1982), 129–164.
J. Ježek: The lattice of equational theories. Part IV: Equational theories of finite algebras. Czechoslovak Math. J. 36 (1986), 331–341.
J. Ježek and R. McKenzie: Definability in the lattice of equational theories of semigroups. Semigroup Forum 46 (1993), 199–245.
A. Kisielewicz: Definability in the lattice of equational theories of commutative semigroups. Trans. Amer. Math. Soc. 356 (2004), 3483–3504.
R. McKenzie, G. McNulty and W. Taylor: Algebras, Lattices, Varieties, Volume I. Wadsworth & Brooks/Cole, Monterey, CA, 1987.