A finite basis theorem for residually finite, congruence meet-semidistributive varieties
Author:
- 12 March 2000
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 65 (1) , 187-200
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 < ω 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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- A Characterization of Varieties with a Difference Term, II: Neutral = Meet Semi-DistributiveCanadian Mathematical Bulletin, 1998
- The Relationship Between Two CommutatorsInternational Journal of Algebra and Computation, 1998
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLEInternational Journal of Algebra and Computation, 1996
- THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLEInternational Journal of Algebra and Computation, 1996
- THE RESIDUAL BOUNDS OF FINITE ALGEBRASInternational Journal of Algebra and Computation, 1996
- Finite equational bases for congruence modular varietiesAlgebra universalis, 1987
- Finite equational bases for finite algebras in a congruence-distributive equational classAdvances in Mathematics, 1977
- Finite equational bases for finite algebras in a congruence-distributive equational classAdvances in Mathematics, 1977
- Semi-categorical algebras. IIMathematische Zeitschrift, 1964
- On comparison of finite algebrasProceedings of the American Mathematical Society, 1952