Proceedings

Computer Understanding of Mathematical Proofs

Download BibTeX Cite

Proceedings of the Fifth International Joint Conference on Artificial Intelligence. Specialized Systems. Pages 851-856.

© 1977 International Joint Conferences on Artificial Intelligence

Abstract

Mathematical proofs constitute a mixture of formulas with a subset of natural language. They can be represented as a sequence of lines expressible in the symbolism of predicate calculus. The transition from step to step may depend on a series of logical manipulations and/or on intricate mathematical knowledge associated with the domain of the proof. The organization of the proof may depend on different conventions adopted by mathematicians in communication with each other. This paper deals with problems involved in following the mathematical argument along those lines. Some of . the ideas were implemented as a part of a system for teaching axiomatic set theory to college students. The most powerful and frequently used rules of inference utilize a resolution theorem prover. To the best of our knowledge this is the only resolution theorem prover, perhaps the only general purpose theorem prover used in actual production.

  1. Abrahams, P., "Machine Verification of Mathe- matical Proof", 1963, Doctoral Dissertation, MIT.
  2. Goldberg, A., "A Generalized Instructional System for Teaching Elementary Mathematical Logic", Tech.Rep.No.l79, 1971, IMSSS, Stanford University.
  3. Marinov, V., "Maximal Clause Length Resolu- tion", 1973, Doctoral Dissertation, University of Texas at Austin.
  4. Marinov, V., "Replace Formula", 1974, IMSSS internal memo, Stanford University.
  5. McCarthy, J., "Computer Programs for Checking Mathematical Proofs", 1961, Proc.Amer.Math. Soc. on Recursive Function Theory, New York.
  6. Smith, R., Graves, H., Blaine, L. and Marinov, V. 1975. "Computer Assisted Axiomatic Mathe- matics: Informal Rigor." In: Computers in Education, 0. Lecarne and R.-rewis, eds. IFIP Second World Conference on Computer Education. North Holland, Amsterdam. pp.803-809.
  7. Smith, R., "BOOLE--A Decision Method", 1974, IMSSS internal memo, Stanford University.
  8. Suppes, P., Introduction to Logic, 1957, Van Nostrand, Princeton, N.J. 9. Suppes, P., Axiomatic Set Theory, 1972~ Dover, New York.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards