Some decidable theories with finitely many covers which are decidable and algorithmically found
Cornelia Kalfa · Colloquium Mathematicum · 1994
In any recursive algebraic language, I find an interval of the lattice of equational theories, every element of which has finitely many covers. With every finite set of equations of this language, an equational theory of this interval is associated, which