A Machine-Assisted Proof of Gödel's Incompleteness theorems for the Theory of Hereditarily Finite Sets

  title={A Machine-Assisted Proof of G{\"o}del's Incompleteness theorems for the Theory of Hereditarily Finite Sets},
  author={Lawrence C. Paulson},
  journal={Rew. Symb. Logic},
A formalization of Gödel’s incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows Świerczkowski (2003), who gave a detailed proof using hereditarily finite set theory. The adoption of this theory is generally beneficial, but it poses certain technical issues that do not arise for Peano arithmetic. The formalization itself should be useful to logicians… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 10 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references

Finite sets and Gödel’s incompleteness theorems

  • S. Świerczkowski
  • Dissertationes Mathematicae, 422, 1–58. Available…
  • 2003
Highly Influential
20 Excerpts

The Logic of Provability

  • G. S. Boolos
  • Cambridge: Cambridge University Press.
  • 1993
Highly Influential
17 Excerpts

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem

  • N. G. de Bruijn
  • Indagationes Mathematicae,
  • 1972
Highly Influential
5 Excerpts

Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

  • K. Gödel
  • Monatshefte für Mathematik und Physik, 38(1), 173…
  • 1931
Highly Influential
4 Excerpts

Shankar, Boyer, Church-Rosser and de Bruijn indices

  • N. Shankar
  • E-mail.
  • 2013
Highly Influential
3 Excerpts

Metamathematics, Machines, and Gödel’s Proof

  • N. Shankar
  • Cambridge : Cambridge University Press.
  • 1994
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…