Abstract.
For a congruence-distributive variety, Maltsev’s construction of principal congruence relations is shown to lead to approximate distributive laws in the lattice of equivalence relations on each member. As an application, in the case of a variety generated by a finite algebra, these approximate laws yield two known results: the boundedness of the complexity of unary polynomials needed in Maltsev’s construction and the finite equational basis theorem for such a variety of finite type. An algorithmic version of the construction is included.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received November 27, 1996; accepted in final form December 16, 2004.
Rights and permissions
About this article
Cite this article
Baker, K.A., Wang, J. Approximate distributive laws and finite equational bases for finite algebras in congruence-distributive varieties. Algebra univers. 54, 385–396 (2005). https://doi.org/10.1007/s00012-005-1928-y
Issue Date:
DOI: https://doi.org/10.1007/s00012-005-1928-y