A new method, called Z-module reasoning, was formulated for proving and discovering theorems from ring theory. In a case study, the ZMR system designed to implement this method was used to prove the benchmark x 3 ring theorem from associative ring theory. The system proved the theorem quite efficiently. The system was then used to prove the x 4 ring theorem from associative ring theory. Again, a proof was produced easily. These proofs, together with the successes in proving other difficult theorems from ring theory suggest that the Z-module reasoning method is useful for solving a class of problems relying on equality reasoning. This paper illustrates the Z-module reasoning method, and analyzes the computer proof of the x 3 ring theorem.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Bledsoe, W. W., ‘Non-resolution theorem proving,’ Artificial Intelligence 9, 1–35 (1977).
Jacobson, N., ‘Lectures in Abstract Algebra,’ D. Van Nostrand Company Inc., New York (1953).
Knuth, D. E. and Bendix, P. B., ‘Simple word problems in universal algebras,’ in Leech, J. (ed.), Computational Problems in Abstract Algebras, Pergamon Press, pp. 263–297 (1970).
Lusk, E. L., and Overbeek, R. A., ‘Reasoning about equality,’ Journal of Automated Reasoning 1, 209–228 (1985).
McCune, W., and Wos, L., ‘A case study in automated theorem proving: searching for sages in combinatory logic’, Journal of Automated Reasoning 3, 91–107 (1987).
Stickel, M. E., ‘A unification algorithm for associative-commutative functions’, Journal of the Association for Computing Machinery 28, 423–434 (1981).
Stickel, M. E., ‘A case study of theorem proving by the Knuth-Bendix method: discovering that x 3=x implies ring commutativity,’ Proceeding of 7th Conference on Automated Deduction, Lecture Notes in Computer Science, Springer-Verlag, New York, pp. 248–258 (1984).
Veroff, R. L., ‘Canonicalization and demodulation’, Report ANL-81–6, Argonne National Laboratory, Argonne, Illinois (February 1981).
Wang, T. C., ‘ECR: an equality conditional resolution proof procedure,’ Proceedings of 8th Conference on Automated Deduction, Lecture Notes in Computer Science Vol. 230, Springer-Verlag, Berlin, pp. 254–271 (1986).
Winker, S., and Wos, L., ‘Automated generation of models and counterexamples and its application to open questions in ternary Boolean algebra,’ Proceedings of Eighth International Symposium on Multiple-valued Logic, Rosemont, IL (IEEE, New York, 1978) pp. 251–256.
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).
Wos, L., ‘Solving open questions with an automated theorem-proving program,’ Proceedings of 6th Conference on Automated Deduction, Lecture Notes in Computer Science Vol. 138, Springer-Verlag, New York, pp. 1–31 (1982).
This reasearch was supported in part by the Applied Mathematical Sciences subprogram of the office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.
About this article
Cite this article
Wang, T. Case studies of Z-module reasoning: Proving benchmark theorems from ring theory. J Autom Reasoning 3, 437–451 (1987). https://doi.org/10.1007/BF00247439
- Automated theorem proving
- Z-module reasoning
- equality reasoning
- pseudo-Gaussian elimination
- ring theory