A finite basis theorem for residually finite, congruence meet-semidistributive varieties
Ross Willard
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.
Create a lesson
Related papers
Directed partial orders on the complex number field
Wenyi Wang, Ruisong Yuan, Yuehui Zhang et al.
Polynomial identities, central polynomials and cocharacters of M2(F) with G-graded involution
Rafael Bezerra dos Santos, Lucas Reis
Polynomial identities, central polynomials and cocharacters of M2(F) with transpose superinvolution
Rafael Bezerra dos Santos, Lucas Reis
Range-compatible homomorphisms on Hermitian matrices
Clément de Seguins Pazzis
Transposed Triple Products and Pro-Symmetric Rings in -Rings
Huaxi Chen, Long Wang, Honglin Zou
On -Reversible and Generalized -Reversible Rings
Huaxi Chen, Long Wang, Honglin Zou