Finite sets and Gödel's incompleteness theorems

S. Świerczkowski · Dissertationes Mathematicae · 2003

We give complete proofs of the two famous incompleteness theorems of Gödel. However, instead of the usual choice of Peano Arithmetic, we take the theory of hereditarily finite sets as the basis for the presentation.

Read the paper · More papers on PaperTik