Skip to main content
Log in

Towards mechanical metamathematics

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bourbaki, N., Elements of Mathematics, Volume: Theory of Sets, Addison-Wesley, Reading, Mass. 1968.

    Google Scholar 

  2. Boyer, R. S. and Moore, J S., A Computational Logic, Academic Press, New York, 1979.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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).

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Gordon, M. J., Milner, A. J. and Wadsworth, C. P., Lecture Notes in Computer Science. Volume 78: Edinburgh LCF. Springer-Verlag, Berlin, 1979.

    Google Scholar 

  7. Kleene, S. C., Introduction to Metamathematics. North-Holland, Amsterdam, 1952.

    Google Scholar 

  8. Paulson, L., ‘Verification the Unification Algorithm in LCF.’ Technical Report 50, University of Cambridge Computer Laboratory, 1984.

  9. Post, E. L., Annals of mathematics series. Volume: ‘The two-valued iterative systems of mathematical logic.’ Princeton University Press, Princeton, New Jersey, 1941.

    Google Scholar 

  10. Shankar, N., ‘Towards Mechanical Metamathematics.’ Technical Report 43, University of Texas Institute for Computing Science, 1984.

  11. Shoenfield, J. R., Mathematical Logic, Addison-Wesley, Reading, Mass., 1967.

    Google Scholar 

  12. Weyhrauch, R. W., ‘Prolegomena to a theory of mechanized formal reasoning’. Artificial Intelligence 13, 133–170 (1980).

    CAS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00244278

Key words

Navigation