A finite basis theorem for residually finite, congruence meet-semidistributive varieties

From MaRDI portal
Publication:4953214

DOI10.2307/2586531zbMATH Open0973.08004arXivmath/9712291OpenAlexW2594244112MaRDI QIDQ4953214FDOQ4953214


Authors: Ross Willard Edit this on Wikidata


Publication date: 5 December 2001

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Abstract: We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-semidistributive and residually less than some finite cardinal, then it is finitely based. Theorem B: there is an algorithm which, given m<w and a finite algebra in a finite language, determines whether the variety generated by the algebra is congruence meet-semidistributive and residually less then m.


Full work available at URL: https://arxiv.org/abs/math/9712291




Recommendations




Cites Work


Cited In (28)





This page was built for publication: A finite basis theorem for residually finite, congruence meet-semidistributive varieties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953214)