Lattices of subclasses (Q1937753)

By a prevariety is meant an axiomatic class of algebras which is closed under subalgebras and direct products. By a finitary prevariety is meant a class closed under subalgebras and countable products. It is proved (Proposition 5.2) that the lattice of meet subsemilattices of an arbitrary meet semilattice with unit is isomorphic to the lattice of finitary subprevarieties of a finitary prevariety, while the lattice of complete meet subsemilattices of an algebraic lattice is isomorphic to the lattice of subprevarieties of a quasivariety (Proposition 5.10). D. E. Palchunov proved that each at most countable complete lattice is isomorphic to a lattice of relatively axiomatizable classes and he asked if the same result holds for an arbitrary complete lattice. The affirmative answer is presented here in Corollary 6.2. V. A. Gorbunov proved that the prevariety lattice of each pseudo-quasivariety of signature with finitely many relational symbols is an inverse limit of finite lower bounded lattices. In this paper the authors prove a more general result for (finitary) prevarieties with no restriction on signature. A. M. Nurakunov proved that there are quasivarieties of algebras such that the set of finite sublattices of their quasivariety lattices is not computable. Here, in Theorem 9.3 we find some quasivarieties of relational structures such that their (quasi)variety lattices or (finitary) prevariety lattices have a noncomputable set of finite sublattices.