Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-26T13:18:04.343Z Has data issue: false hasContentIssue false
  • English
  • Français

The existence of finitely based lower covers for finitely based equational theories

Published online by Cambridge University Press:  12 March 2014

Jaroslav Ježek  and
George F. McNulty
Jaroslav Ježek*
Affiliation:
Department of Mathematics, University of South Carolina, Columbia, South Carolina 29208
George F. McNulty
Affiliation:
Department of Mathematics, University of South Carolina, Columbia, South Carolina 29208, E-mail: [email protected]
*
MFF, Sokolovska 83, 18600 Praha 8, Czech Republic, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Extract

By an equational theory we mean a set of equations from some fixed language which is closed with respect to logical consequences. We regard equations as universal sentences whose quantifier-free parts are equations between terms. In our notation, we suppress the universal quantifiers. Once a language has been fixed, the collection of all equational theories for that language is a lattice ordered by set inclusion The meet in this lattice is simply intersection; the join of a collection of equational theories is the equational theory axiomatized by the union of the collection. In this paper we prove, for languages with only finitely many fundamental operation symbols, that any nontrivial finitely axiomatizable equational theory covers some other finitely axiomatizable equational theory. In fact, our result is a little more general.

There is an extensive literature concerning lattices of equational theories. These lattices are always algebraic. Compact elements of these lattices are the finitely axiomatizable equational theories. We also call them finitely based. The largest element in the lattice is compact; it is the equational theory based on the single equation x ≈ y. The smallest element of the lattice is the trivial theory consisting of tautological equations. For all but the simplest languages, the lattice of equational theories is intricate. R. McKenzie in [6] was able to prove in essence that the underlying language can be recovered from the isomorphism type of this lattice.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 60 , Issue 4 , December 1995 , pp. 1242 - 1250
Copyright
Copyright © Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Birkhoff, G., On the structure of abstract operators, Proceedings of the Cambridge Philosophical Society, vol. 31 (1935), pp. 433–454.CrossRefGoogle Scholar
[2]Ježek, J., Intervals in the lattice of varieties, Algebra Universalis, vol. 6 (1976), pp. 147–158.CrossRefGoogle Scholar
[3]Ježek, J., The lattice of equational theories Parts I–IV, Czechoslovak Mathematical Journal, vol. 31 (1981), pp. 127–152, 573–603; vol. 32 (1982), pp. 129–164; vol. 36 (1986), pp. 331–341.CrossRefGoogle Scholar
[4]Lampe, W., A property of the lattice of equational theories, Algebra Universalis, vol. 23 (1986), pp. 61–69.CrossRefGoogle Scholar
[5]Mal'tsev, A. I., Identical relations on varieties of quasigroups, Matematicheskiǐ Sbornik, vol. 69 (111) (1966), pp. 3–12; English translation, American Mathematical Society Translations ser. 2, vol. 82 (1969), pp. 225–235.Google Scholar
[6]McKenzie, R., Definability in lattices of equational theories, Annals of Mathematical Logic, vol. 3 (1970), pp. 197–237.CrossRefGoogle Scholar
[7]McKenzie, R., Tarski's finite basis problem is undecidable, International Journal of Algebra and Computation (to appear).Google Scholar
[8]McKenzie, R., McNulty, G., and Taylor, W, Algebras, lattices, varieties, Vol. 1, Brooks/Cole, Monterey, California, 1987.Google Scholar
[9]McNulty, G., Structural diversity in the lattice of equational theories, Algebra Universalis, vol. 13 (1981), pp. 271–292.CrossRefGoogle Scholar
[10]McNulty, G., Covering in the lattice of equational theories and some properties of term finite theories, Algebra Universalis, vol. 15 (1982), pp. 115–125.CrossRefGoogle Scholar
[11]McNulty, G., A field guide to equational logic, Journal of Symbolic Computation, vol. 14 (1992), pp. 371–397.CrossRefGoogle Scholar
[12]McNulty, G., The decision problem for equational bases of algebras, Annals of Mathematical Logic, vol. 11 (1976), pp. 193–259.CrossRefGoogle Scholar
[13]McNulty, G., Undecidable properties offinite sets of equations, this Journal, vol. 41 (1976), pp. 589–604.Google Scholar
[14]Murskiǐ, V. L., Nondiscernible properties of finite systems of relations, Doklady Akademii Nauk SSSR, vol. 196 (1971), pp. 520–522; English translation, Soviet Mathematics—Doklady, vol. 12 (1971), pp. 183–186.Google Scholar
[15]Perkins, P., Unsolvable problems for equational theories, Notre Dame Journal of Formal Logic, vol. 8 (1967), pp. 175–185.CrossRefGoogle Scholar
[16]PollAk, G., On the existence of covers in the lattice of varieties, Contributions to general algebra (proceedings of the Klagenfurt conference; Kautschitsch, H.et al., editors), Verlag Johannes Heyn, Klagenfurt, 1979, pp. 235–247.Google Scholar
[17]Pigozzi, D. and Tárdos, G., The representation of certain abstract lattices as lattices of subvarieties (to appear).Google Scholar
[18]Taylor, W., Equational logic, Houston Journal of Mathematics 1979, Survey issue.Google Scholar
[19]Trahtman, A. N., On covers in lattices of varieties of universal algebras, Matematicheskie Zametki, vol. 15 (1974), pp. 307–312; English translation, Mathematical Notes, vol. 15 (1974), pp. 174–177.Google Scholar