Automated proofs of the Moufang identities in alternatives rings
Journal of Automated Reasoning
Handbook of theoretical computer science (vol. B)
Experimenting with the identity (xy)z = y(zx)
Journal of Symbolic Computation
The Albert nonassociative algebra system: a progress report
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
A Case Study of Completion Modulo Distributivity and Abelian Groups
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
Using the notion of modified completion given in Widiger, A. (1998, Deciding degree-four-identities for alternative rings by rewriting. In Bronstein, M., Grabmeier, J., Weispfenning, V. eds, Symbolic Rewriting Techniques, PCS 15, pp. 277-288. Birkhäuser-Verlag), it is shown that the word problem for the varieties of non-associative rings defined by (xy)z=y(zx) and (xy)z=y(xz) respectively can be decided by rewriting.