Deciding Degree-Four-Identities for Alternative Rings by Rewriting
Alfred Widiger · Birkhäuser Basel eBooks · 1998
Rewriting can be used to prove automatically identities for alternative rings, see for example [7], but no complete rewrite system is known. In this paper I give rewrite systems for several classes of alternative rings which can be used to decide whether an equation up to degree 4 is an identity for the class of rings considered. For the class of strongly left alternative rings I was able to compute an analogous rewrite system for degree 5.