PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II
Benjamin Wells · International Journal of Algebra and Computation · 2012
Constructions that yield pseudorecursiveness in [I] (Int. J. Algebra Comput.6 (1996) 457–510) are extended in this article. Finitely based varieties of semigroups with increasingly strict expansions by additional unary operation symbols or individual constants are shown to have the pseudorecursive property: the equational theory is undecidable, but the subsets obtained by bounding the number of distinct variables are all recursive. The most stringent case considered here is the single unary operation or distinguished element. New techniques of stratified reducibility and interpretation via rewriting rules are employed to show the property inherits along a chain of theories. Pure semigroup varieties that are both finitely based and pseudorecursive will be discussed in a later paper.