Abstract
AbstractWe 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 < ω and a finite algebra in a finite language, determines whether the variety generated by the algebra is congruence meet-semidistributive and residually less than m.
Publisher
Cambridge University Press (CUP)
Reference23 articles.
1. Park R. , Equational classes of non-associative ordered algebras, Ph.D. dissertation , UCLA, 1976.
2. McNulty G. and Willard R. , Three-element algebras behaving badly, in preparation.
3. Residually small varieties
4. Finite equational bases for congruence modular varieties
5. Residually finite, congruence meet-semidistributive varieties of finite type have a finite residual bound
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献