Extending Baker's theorem (Q5950760): Difference between revisions

In 1972, K. Baker stated the famous theorem: Let \(\mathcal V\) be a congruence distributive variety in a finite language. If \(\mathcal V\) is residually bounded then \(\mathcal V\) is finitely based. R. Park conjectured in 1976 a positive answer to the following problem: Suppose \(\mathcal V\) is a variety in a finite language. If \(\mathcal V\) is residually bounded, must \(\mathcal V\) be finitely based? The problem remains open, but the author proved in a recent paper that Baker's theorem remains true when congruence distributivity is replaced by meet congruence semi-distributivity. The present paper summarizes the combinatorical properties of congruence generation which are relevant to Baker's theorem and explains the author's approach to extending this theorem to congruence semi-distributive varieties.