Skip to main content

Deciding Degree-Four-Identities for Alternative Rings by Rewriting

  • Conference paper
  • 349 Accesses

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 15))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beck, R.E.; Kolman, B. (eds): Computers in Nonassociative Rings and Algebras, Academic Press, New York 1977.

    Google Scholar 

  2. Dershowitz, N.; Jouannaud, J.P.: Rewrite systems. In J. van Leeuwen (ed.): Handbook of Theoretical Computer Science. North Holland 1990.

    Google Scholar 

  3. Hentzel, I.R.; Jacobs, D.P.: A Dynamic Programming Method for Building Free Algebras. Computers & Mathematics with Applications 22, 61–66, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  4. Jacobs, D.P.: The Albert nonassociative algebra system: a progress report. ISSAC ′94 Proceedings, ACM 1994, 41-44.

    Google Scholar 

  5. Kleinfeld, E.; Humm, M.: A nonidentity for right alternative rings. Proc. Amer. Math. Soc. 22 (1969), 109–110.

    Article  MathSciNet  MATH  Google Scholar 

  6. Widiger, A.: Termersetzungssysteme zum Beweis von Identitäten bis zum Grad 4 in Klassen alternativer Ringe. Rostocker Informatik-Berichte 16 (1994), 77–99.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. Zhevlakov, K.A. et al: Rings that are nearly associative, Academic Press, New York 1982.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics