Solving the word problem for two classes of non-associative rings by rewriting

DOI10.1006/JSCO.2000.0404zbMath1116.17300OpenAlexW1986117021MaRDI QIDQ5945294

Alfred Widiger

Publication date: 10 October 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/254a5abd5e64a00d11df4713656a0c5063e6b24d

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40) Nonassociative algebras satisfying other identities (17A30)

Cites Work

• Automated proofs of the Moufang identities in alternative rings
• A dynamic programming method for building free algebras
• Experimenting with the identity \((xy)z=y(zx)\)
• Ringe mit \(x(yz)=(yx)z\).
• A case study of completion modulo distributivity and Abelian groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the word problem for two classes of non-associative rings by rewriting