Finite sets and Gödel's incompleteness theorems

S. Świerczkowski

  • 2003

Abstract

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

How to cite

top

S. Świerczkowski. Finite sets and Gödel's incompleteness theorems. 2003. <http://eudml.org/doc/285944>.

@book{S2003,
abstract = {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.},
author = {S. Świerczkowski},
keywords = {hereditarily finite sets; coding; Gödel’s incompleteness theorems},
language = {eng},
title = {Finite sets and Gödel's incompleteness theorems},
url = {http://eudml.org/doc/285944},
year = {2003},
}

TY - BOOK
AU - S. Świerczkowski
TI - Finite sets and Gödel's incompleteness theorems
PY - 2003
AB - 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.
LA - eng
KW - hereditarily finite sets; coding; Gödel’s incompleteness theorems
UR - http://eudml.org/doc/285944
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.