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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.