**This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.**

### Abstract

Gödel's two incompleteness theorems are formalised, following a careful presentation by Swierczkowski, in the theory of hereditarily finite sets. This represents the first ever machine-assisted proof of the second incompleteness theorem. Compared with traditional formalisations using Peano arithmetic (see e.g. Boolos), coding is simpler, with no need to formalise the notion
of multiplication (let alone that of a prime number)
in the formalised calculus upon which the theorem is based.
However, other technical problems had to be solved in order to complete the argument.

### License

### Topics

### Session Incompleteness

- SyntaxN
- Coding
- Predicates
- Sigma
- Coding_Predicates
- Pf_Predicates
- Functions
- Goedel_I
- II_Prelims
- Pseudo_Coding
- Quote
- Goedel_II