SOLVING THE WORD PROBLEM FOR A PERMUTATIVE RING VARIETY BY REWRITING

Abstract

Using the notion of modified completion given in [6], it is shown that the word problem for the variety of nonassociative rings defined by the permutative identity (xy)z =(zx)y can be decided by rewriting.