Finitely Boolean representable varieties
HTML articles powered by AMS MathViewer
- by Emil W. Kiss PDF
- Proc. Amer. Math. Soc. 89 (1983), 579-582 Request permission
Abstract:
This paper gives a short, elementary proof of a result of Burris and McKenzie [2] stating that each variety Boolean representable by a finite set of finite algebras is the join of an abelian and a discriminator variety. An example showing that the Boolean product operator ${\Gamma ^a}$ is not idempotent is included as well.References
- S. Burris and R. McKenzie, Decidable varieties with modular congruence lattices, Bull. Amer. Math. Soc. (N.S.) 4 (1981), no. 3, 350–352. MR 609049, DOI 10.1090/S0273-0979-1981-14912-0 —, Boolean representable varieties, Mem. Amer. Math. Soc. 31 (1981), No. 246, 67-106.
- Ralph Freese and Ralph McKenzie, Residually small varieties with modular congruence lattices, Trans. Amer. Math. Soc. 264 (1981), no. 2, 419–430. MR 603772, DOI 10.1090/S0002-9947-1981-0603772-9 E. W. Kiss, Skew and complemented congruences, preprint, 1982.
- Ralph McKenzie, Narrowness implies uniformity, Algebra Universalis 15 (1982), no. 1, 67–85. MR 663953, DOI 10.1007/BF02483709
- Heinrich Werner, Discriminator-algebras, Studien zur Algebra und ihre Anwendungen [Studies in Algebra and its Applications], vol. 6, Akademie-Verlag, Berlin, 1978. Algebraic representation and model theoretic properties. MR 526402
Additional Information
- © Copyright 1983 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 89 (1983), 579-582
- MSC: Primary 08B10; Secondary 03B25
- DOI: https://doi.org/10.1090/S0002-9939-1983-0718976-1
- MathSciNet review: 718976