Decidability of elementary theories of lattices of subsemigroups (Q920966): Difference between revisions

Let \({\mathcal E}\) be an elementary language, Sub be the operator of taking the lattices of subsemigroups. The variety of semigroups \({\mathcal M}\) is said to be \({\mathcal E} Sub\)-solvable if the elementary theory \({\mathcal E} Sub {\mathcal M}\) of the class Sub \({\mathcal M}=\{Sub A|\) \(A\in {\mathcal M}\}\) is solvable. The main result of the paper is: Theorem. The variety of semigroups \({\mathcal M}\) is \({\mathcal E} Sub\)-solvable iff \({\mathcal M}\subset [xyz=xz]\) or \({\mathcal M}\subseteq [xyz=x]\) \([x^ ny=y\), \(xy=yx]\) for some \(n\geq 1\).