Skip to main content
Log in

Solving open problems in right alternative rings with Z-module reasoning

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This paper presents our experiments using an automated reasoning program, called the Z-module reasoning system, to prove a number of interesting theorems in right alternative rings. Important results include a computer solution of the conjecture that (x, x, y)2 x(x, x, y) 2=0 holds in every right alternative ring and a computer solution of a generalized version of this conjecture. The paper illustrates how one uses the Z-module reasoning system to solve different problems with varying complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Albert, A. A., ‘On right alternative algebras’, Annual of Mathematics 50, 161–177 (1949).

    Google Scholar 

  2. Bledsoe, W. W., ‘The UT interactive prover’, Tech. Report, Automatic Theorem Proving Project, ATP-17b, University of Texas at Austin (1983).

  3. Kleinfield, E., ‘Right alternative rings’, Proc. Amer. Math. Soc. 4, 939–944 (1953).

    Google Scholar 

  4. Lusk, E. L. and Overbeek, R. A., ‘Reasoning about equality’, Journal of Automated Reasoning 1, 209–228 (1985).

    Google Scholar 

  5. Micheev, I. M., ‘A certain identity in right alternative rings’ (in Russian), Albebra i Logika 8, 345–366 (1969).

    Google Scholar 

  6. Stevens, R. L., ‘Some experiments in nonassociative ring theory with an automated theorem prover’, Journal of Automated Reasoning 3, 211–221 (1987).

    Google Scholar 

  7. Thedy, A., ‘Right alternative rings’, Journal of Algebra 1, 1–43 (1975).

    Google Scholar 

  8. Wang, T. C., ‘ECR: an equality conditional resolution proof procedure’, Proceedings of 8th Conference on Automated Deduction, Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 230, pp. 254–271 (1986).

    Google Scholar 

  9. Wang, T. C., ‘Case studies of Z-module reasoning: proving benchmark theorems from ring theory’, Journal of Automated Reasoning 3, 437–451 (1987).

    Google Scholar 

  10. Wang, T. C., ‘Elements of Z-module Reasoning’, Proceeding of 9th Conference on Automated Deduction, Lecture Notes in Computer Science, Springer-Verlag, Argonne, Vol. 310, pp. 21–40 (1988).

    Google Scholar 

  11. Wos, L. and Robinson, G. A., ‘Paramodulation and set of support’, Proceedings of the IRIA Symposium on Automatic Demonstration, Versailles, France, Springer-Verlag, pp. 276–310 (1968). (1968).

    Google Scholar 

  12. Zhevlakov, K. A., et al., ‘Rings that are nearly associative’, Academic Press, New York, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by the Applied Mathematical Sciences subprogram of the office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, TC., Stevens, R. Solving open problems in right alternative rings with Z-module reasoning. J Autom Reasoning 5, 141–165 (1989). https://doi.org/10.1007/BF00243001

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00243001

Key words

Navigation