This article gives a sketch of a proof of Gödel's first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses, which are discussed as needed during the sketch. We will assume for the remainder of the article that a fixed theory satisfying these hypotheses has been selected.Throughout this article the word "number" refers to a natural number.
| Attributes | Values |
|---|---|
| rdfs:comment |
|
| is rdfs:seeAlso of |