The pseudoidentity problem and reducibility for completely regular semigroups

Necessary and sufficient conditions for equality over the pseudovariety CR of all finite completely regular semigroups are obtained. They are inspired by the solution of the word problem for free completely regular semigroups and clarify the role played by groups in the structure of such semigroups. A strengthened version of Ash's inevitability theorem (κ-reducibility of the pseudovariety G of all finite groups) is proposed as an open problem and it is shown that, if this stronger version holds, then CR is also κ-reducible and, therefore, hyperdecidable. © Clearance Centre, Inc.