Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beck, R.E.; Kolman, B. (eds): Computers in Nonassociative Rings and Algebras, Academic Press, New York 1977.
Dershowitz, N.; Jouannaud, J.P.: Rewrite systems. In J. van Leeuwen (ed.): Handbook of Theoretical Computer Science. North Holland 1990.
Hentzel, I.R.; Jacobs, D.P.: A Dynamic Programming Method for Building Free Algebras. Computers & Mathematics with Applications 22, 61–66, 1991.
Jacobs, D.P.: The Albert nonassociative algebra system: a progress report. ISSAC ′94 Proceedings, ACM 1994, 41-44.
Kleinfeld, E.; Humm, M.: A nonidentity for right alternative rings. Proc. Amer. Math. Soc. 22 (1969), 109–110.
Widiger, A.: Termersetzungssysteme zum Beweis von Identitäten bis zum Grad 4 in Klassen alternativer Ringe. Rostocker Informatik-Berichte 16 (1994), 77–99.
Zhang, H.: A case study of completion modulo distributivity and abelian groups. In Kirchner, C. (ed.): Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, 32–46, Springer-Verlag, Berlin 1993.
Zhevlakov, K.A. et al: Rings that are nearly associative, Academic Press, New York 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Basel AG
About this paper
Cite this paper
Widiger, A. (1998). Deciding Degree-Four-Identities for Alternative Rings by Rewriting. In: Bronstein, M., Weispfenning, V., Grabmeier, J. (eds) Symbolic Rewriting Techniques. Progress in Computer Science and Applied Logic, vol 15. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8800-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8800-4_14
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9779-2
Online ISBN: 978-3-0348-8800-4
eBook Packages: Springer Book Archive