Decidability of semigroup identities in soluble groups

Abstract

Let G be a finitely generated soluble group with solvable word problem. It is known that the equational theory of G need not be decidable. We prove that the semigroup theory of G, that is, the set of identites of G that have the form u = v where u and v are inverse-free, is decidable.