Abstract
Metamathematics is a source of many interesting theorems and difficult proofs. This paper reports the results of an experiment to use the Boyer-Moore theorem prover to proof-check theorems in metamathematics. We describe a First Order Logic due to Shoenfield and outline some of the theorems that the prover was able to prove about this logic. These include the tautology theorem which states that every tautology has a proof. Such proofs can be used to add new proof procedures to a proof-checking program in a sound and efficient manner.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Bourbaki, N., Elements of Mathematics, Volume: Theory of Sets, Addison-Wesley, Reading, Mass. 1968.
Boyer, R. S. and Moore, J S., A Computational Logic, Academic Press, New York, 1979.
Boyer, R. S., and Moore, J S. Moore, ‘Metafunctions: Proving them correct and using them efficiently as new proof procedures,’ in The Correctness Problem in Computer Science, (eds. R. S. Boyer and J S. Moore) Academic Press, New York, 1981.
Brown, F. M., ‘An investigation into the goals of research in automtic theorem proving as related to mathematical reasoning’, Artificial Intelligence 14, 221–242 (1980).
Davis, M. and Schwartz, J., ‘Metamathematical extensibility for theorem verifiers and proof-checkers.’ Courant Computer Science Report 12, Courant Institute of Mathematical Sciences, New York, 1977.
Gordon, M. J., Milner, A. J. and Wadsworth, C. P., Lecture Notes in Computer Science. Volume 78: Edinburgh LCF. Springer-Verlag, Berlin, 1979.
Kleene, S. C., Introduction to Metamathematics. North-Holland, Amsterdam, 1952.
Paulson, L., ‘Verification the Unification Algorithm in LCF.’ Technical Report 50, University of Cambridge Computer Laboratory, 1984.
Post, E. L., Annals of mathematics series. Volume: ‘The two-valued iterative systems of mathematical logic.’ Princeton University Press, Princeton, New Jersey, 1941.
Shankar, N., ‘Towards Mechanical Metamathematics.’ Technical Report 43, University of Texas Institute for Computing Science, 1984.
Shoenfield, J. R., Mathematical Logic, Addison-Wesley, Reading, Mass., 1967.
Weyhrauch, R. W., ‘Prolegomena to a theory of mechanized formal reasoning’. Artificial Intelligence 13, 133–170 (1980).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shankar, N. Towards mechanical metamathematics. J Autom Reasoning 1, 407–434 (1985). https://doi.org/10.1007/BF00244278
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00244278