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

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

1997-12-11

arxiv.org/abs/math/9712291v1

Mathematics

Rings and Algebras

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

A finite basis theorem for residually finite, congruence meet-semidistributive varieties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A finite basis theorem for residually finite, congruence meet-semidistributive varieties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A finite basis theorem for residually finite, congruence meet-semidistributive varieties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527419