Skip to main content
SpringerLink
Log in

A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle

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

Abstract

An Isabelle/HOL formalisation of Gödel’s two incompleteness theorems is presented. The work follows Świerczkowski’s detailed proof of the theorems using hereditarily finite (HF) set theory (Dissertationes Mathematicae 422, 1–58, 2003). Avoiding the usual arithmetical encodings of syntax eliminates the necessity to formalise elementary number theory within an embedded logical calculus. The Isabelle formalisation uses two separate treatments of variable binding: the nominal package (Logical Methods in Computer Science 8(2:14), 1–35, 2012) is shown to scale to a development of this complexity, while de Bruijn indices (Indagationes Mathematicae 34, 381–392, 1972) turn out to be ideal for coding syntax. Critical details of the Isabelle proof are described, in particular gaps and errors found in the literature.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bagaria, J.: A short guide to Gödel’s second incompleteness theorem. Teorema 22(3), 5–15 (2003)

    Google Scholar 

  2. Boolos, G.S.: The logic of provability, Cambridge University Press (1993)

  3. de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem. Indag. Math. 34, 381–392 (1972)

    Article  Google Scholar 

  4. Feferman, S. (ed.): Kurt Gödel, Collected Works, volume I. Oxford University Press (1986)

  5. Franzén, T.: Gödel’s theorem: An incomplete guide to its use and abuse. A K Peters (2005)

  6. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Form. Asp. Comput. 13, 341–363 (2001)

    Article  Google Scholar 

  7. Gödel, K.: On completeness and consistency. In: Feferman 4, pp 234–236

  8. Gödel, K.: On formally undecidable propositions of Principia Mathematica and related systems. In: Feferman 4, pp. 144–195. First published in 1931 in the Monatshefte für Mathematik und Physik (1931)

  9. Grandy, R.E.: Advanced Logic for Applications. Reidel (1977)

  10. Harrison, J.: Re: Gödel’s incompleteness theorem, Email dated 15 January (2014)

  11. Harrison, J.: Towards self-verification of HOL Light. In: Furbach, U., Shankar, N. (eds.) Automated Reasoning — Third International Joint Conference, IJCAR, 2006, LNAI 4130, pp. 177–191. Springer (2006)

  12. Harrison, J.: Handbook of Practical Logic and Automated Reasoning. Cambridge University Press (2009)

  13. Richard, E.H.: An Introduction to Mathematical Logic. PWS Publishing Company (1995)

  14. Hurd, J., Melham, T.: Theorem Proving in Higher Order Logics: TPHOLs 2005, LNCS 3603. Springer (2005)

  15. Kirby, L.: Addition and multiplication of sets. Math. Logic Q. 53(1), 52–65 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kunen, K.: Set Theory : An Introduction to Independence Proofs. North-Holland (1980)

  17. Lochbihler, A.: Formalising finfuns — generating code for functions as data from Isabelle/HOL. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs, vol. 5674 of Lecture Notes in Computer Science, pp. 310–326. Springer (2009)

  18. Nipkow, T.: More Church-Rosser proofs (in Isabelle/HOL). J. Autom. Reason. 26, 51–66 (2001)

  19. Nipkow T., Lawrence, C. P.: Proof pearl: Defining functions over finite sets. In: Hurd and Melham 14, pp. 385–396.

  20. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer. An up-to-date version is distributed with Isabelle (2002)

  21. Norrish, M., Vestergaard, R.: Proof pearl: de Bruijn terms really do work. In: Schneider, K., Brandt, J. (eds.) Theorem Proving in Higher Order Logics: TPHOLs 2007, LNCS 4732, pp. 207–222. Springer (2007)

  22. O’Connor, R.: Essential incompleteness of arithmetic verified by Coq. In Hurd and Melham 14

  23. Russell, S.S.: O’Connor. Incompleteness & Completeness: Formalizing Logic and Analysis in Type Theory. PhD thesis, Radboud University Nijmegen (2009)

  24. Lawrence, C.: Paulson. Set theory for verification: I. From foundations to functions. J. Autom. Reas. 11(3), 353–389 (1993)

    Article  MATH  Google Scholar 

  25. Paulson, L.C.: The relative consistency of the axiom of choice — mechanized using Isabelle/ZF. LMS J. Comput. Math. 6, 198–248 (2003). http://www.lms.ac.uk/jcm/6/lms2003-001/

    Article  MATH  MathSciNet  Google Scholar 

  26. Paulson, L.C.: Gödel’s incompleteness theorems. Archive of Formal Proofs. November. Formal proof development. (2013). http://afp.sf.net/entries/Incompleteness.shtml

  27. Paulson, L.C.: A machine-assisted proof of Gödel’s incompleteness theorems for the theory of hereditarily finite sets. Rev. Symb. Log. 7(3), 484–498 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  28. Pitts, A.M.: Nominal sets names and symmetry in computer science. Cambridge University Press (2013)

  29. Shankar, N.: Proof-checking Metamathematics. PhD thesis, University of Texas at Austin (1986)

  30. Shankar, N.: Metamathematics Machines, and Gödel’s Proof. Cambridge University Press (1994)

  31. Shankar, N., Shankar, B.: Church-Rosser and de Bruijn indices. E-mail (2013)

  32. Świerczkowski, S.: Finite sets and Godel’s̈ incompleteness theorems. Dissertationes Mathematicae 422, 1–58 (2003). http://journals.impan.gov.pl/dm/Inf/422-0-1.html

    Article  MATH  Google Scholar 

  33. Urban, C.: Nominal techniques in Isabelle/HOL. J. Autom. Reason. 40(4), 327–356 (2008)

  34. Urban, C., Kaliszyk, C.: General bindings and alpha-equivalence in Nominal Isabelle. Log. Methods Comput. Sci. 8(2:14), 1–35 (2012)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Laboratory, University of Cambridge, Cambridge, England

    Lawrence C. Paulson

Authors
  1. Lawrence C. Paulson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lawrence C. Paulson.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Paulson, L.C. A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle. J Autom Reasoning 55, 1–37 (2015). https://doi.org/10.1007/s10817-015-9322-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-015-9322-8

Keywords

Search

Navigation