Free products and the word problem (Q1108303)

An example is given to show that even in a variety whose free word problem is solvable, the free product of two recursive presentations with solvable word problems may have unsolvable word problem. Moreover, under some conditions on the syntax of the identities defining the variety (formulated using the rewrite-completion techniques) the free product is shown to preserve solvability of word problems for recursive presentations.