Non-finitely based monoids. (Q744847)

The author provides eight conditions under which a monoid \(S\) admits no finite identity basis (Theorem 4.4). Each of these conditions involves two parameters -- a finite set of words \(W\) and an infinite sequence of identities \(\Sigma\) -- and is formulated as follows: if \(S\) satisfies all identities in \(\Sigma\) but each word in \(W\) is an isoterm for \(S\), then \(S\) is non-finitely based. The techniques used in the proof is also applied to simplify some known conditions under which a semigroup is non-finitely based, in particular, the ones found by \textit{P. Perkins} [J. Algebra 11, 298-314 (1969; Zbl 0186.03401)] and \textit{E. W. H. Lee} [Monatsh. Math. 168, No. 3-4, 461-472 (2012; Zbl 1292.20065)]; as yet another application the author provides a new proof for a result due to the reviewer [Int. J. Algebra Comput. 14, No. 5-6, 817-827 (2004; Zbl 1074.20036)].