Some experiments in nonassociative ring theory with an automated theorem prover
- 27 Downloads
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.
KeywordsArtificial Intelligence Open Problem Mathematical Logic Theorem Prove Algebraic Manipulation
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 2.Lusk, E. and Overbeek, R., The Automated Reasoning System ITP. Argonne National Laboratory, ANL-84-27, 1984.Google Scholar
- 3.Schafer, R. D., An Introduction to Nonassociative Algebras. Academic Press, New York, 1966.Google Scholar
- 4.Zhevlakov, K. A. et al., Rings that are Nearly Associative. Academic Press, New York, 1982.Google Scholar