Complexity of quasivariety lattices. (Q903184)

A quasivariety \(\mathbf K\) is a class of algebraic systems closed under isomorphisms, subsystems, direct products, and ultraproducts. The quasivarieties contained in a quasivariety \(\mathbf K\) form a complete lattice \(\mathbf{Lq(K)}\) under inclusion. Quasivariety lattices might be highly complex. A measure of complexity is given by the notion of \textit{Q-universality} introduced by \textit{M. V. Sapir}, [Algebra Univers. 21, 172-180 (1985; Zbl 0599.08014)]. \(\mathbf K\) is \textit{Q-universal} if for every quasivariety \(\mathbf M\) the lattice \(\mathbf{Lq(M)}\) is a homomorphic image of some sublattice of \(\mathbf{Lq(K)}\). In [\textit{A. M. Nurakunov}, Int. J. Algebra Comput. 22, No. 3, Paper No. 1250006 (2012; Zbl 1255.08002)] it has been shown that there is no algorithm to decide whether a given finite lattice embeds into the quasivariety lattice of a certain (Q-universal) quasivariety. This undecidability property (\textit{unreasonability}) can be viewed as another measure of complexity for lattices. In [\textit{M. E. Adams} and \textit{W. Dziobiak}, Proc. Am. Math. Soc. 120, No. 4, 1053-1059 (1994; Zbl 0810.08007)] a set of sufficient conditions for a quasivariety to be Q-universal has been found. In the reviewed paper a generalization of these conditions is introduced. Then, it is shown that quasivarieties satisfying the generalized conditions are \textit{unreasonable} in the sense of Nurakunov. It follows that almost all known Q-universal quasivarieties are unreasonable, too.