Category:Gödel's Incompleteness Theorems
Jump to navigation
Jump to search
This category contains pages concerning Gödel's Incompleteness Theorems:
Gödel's First Incompleteness Theorem
Let $T$ be the set of theorems of some recursive set of sentences in the language of arithmetic such that $T$ contains minimal arithmetic.
$T$ cannot be both consistent and complete.
Gödel's Second Incompleteness Theorem
Let $T$ be the set of theorems of some recursive set of sentences in the language of arithmetic such that $T$ contains minimal arithmetic.
Let $\map {\mathrm {Cons} } T$ be the propositional function which states that $T$ is consistent.
Then it is not possible to prove $\map {\mathrm {Cons} } T$ by means of formal statements within $T$ itself.
Source of Name
This entry was named for Kurt Friedrich Gödel.
Pages in category "Gödel's Incompleteness Theorems"
The following 7 pages are in this category, out of 7 total.