Abstract
This paper presents some experiments using an automated theorem proving program (ATP) to prove theorems in nonassociative ring theory of varying difficulty. Several simple theorems proved by the program are discussed and other more difficult theorems that have been attempted are presented with some commentary as to why the program failed to find certain proofs. We also give some open problems that might be suitable for investigation with an ATP.
Similar content being viewed by others
References
Wos, L. and Robinson, G. A., Paramodulation and set of support, in Proceedings of the IRIA Symposium on Automatic Demonstration, Versailles, France, Springer-Verlag Publ. 1968, pp. 276–340.
Lusk, E. and Overbeek, R., The Automated Reasoning System ITP. Argonne National Laboratory, ANL-84-27, 1984.
Schafer, R. D., An Introduction to Nonassociative Algebras. Academic Press, New York, 1966.
Zhevlakov, K. A. et al., Rings that are Nearly Associative. Academic Press, New York, 1982.
Author information
Authors and Affiliations
Additional information
This work 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
About this article
Cite this article
Stevens, R.L. Some experiments in nonassociative ring theory with an automated theorem prover. J Autom Reasoning 3, 211–221 (1987). https://doi.org/10.1007/BF00243209
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00243209