Abstract

Ross Willard proved that every congruence meet-semidistributive variety of algebras that has a finite residual bound and a finite signature can be axiomatized by some finite set of equations. We offer here a simplification of Willard’s proof, avoiding its use of Ramsey’s Theorem. This simplification also extends Willard’s theorem by replacing the finite residual bound with a weaker condition.

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.