A general finite basis condition for systems of semigroup identities (Q804711)

Beginning from a countable alphabet, the author uses certain ordering properties to define the notion of a coherent set of semigroup words. Using this notion he formulates and proves his main theorem, which provides a sufficient condition for a system of identities to be finitely based. The following corollaries are then proved: a system of identities determined by a fixed non-negative integer, in the sense that both parts of each identity have level not exceeding that integer, is finitely based; and a system of identities in which both parts have at most one repeated letter is finitely based. The second of these was previously announced in a paper of \textit{L. N. Shevrin} and \textit{M. V. Volkov} [Izv. Vyssh. Uchebn. Zaved., Mat. 1985, No.11, 3-47 (1985; Zbl 0629.20029)].