##  [Gödel Sentence](/godel-sentence-0) 

 Definition

A self-referential sentence G constructed (via the diagonal lemma) for a given formal theory T that effectively asserts 'G is not provable in T'; its existence is central to incompleteness proofs because, under natural hypotheses, neither G nor its negation is provable in T.

 

 

 

 

 

 





## Principle

Principle

Use the fixed-point/diagonal lemma to produce a sentence that names its own provability status by coding syntactic notions into arithmetic; the sentence is engineered so that provability of G in T would contradict T's consistency, yielding undecidability.

 

 

 

 

 





## Demonstration

Demonstration

For a recursively axiomatized theory T that represents provability, one constructs a formula Prov_T(x) and applies the diagonal lemma to obtain G with T ⊢ (G ↔ ¬Prov_T(⌜G⌝)). If T is consistent, T cannot prove G; if T is sufficiently well-behaved it also cannot prove ¬G, making G undecidable in T.

 

 

 

 

## Misapplication

Misapplication

Confusing a Gödel sentence with a semantic paradox (e.g., the liar) or claiming that every self-referential sentence is a Gödel sentence; also calling any unprovable sentence 'the' Gödel sentence without reference to the theory and coding used.

 

 

 

 

 





## Consequence

Consequence

Provides explicit examples of sentences that are undecidable in the theory and exhibits the gap between syntactic provability and semantic truth; in the standard model such a Gödel sentence will be true whenever the theory is consistent.

 

 

 

 

## Reversal

Reversal

Negating the Gödel sentence yields a sentence whose provability in T typically implies T is inconsistent; thus proof of ¬G inside T is a witness to inconsistency under the usual hypotheses.

 

 

 

 

 





## Boundary

Boundary

Requires that the theory be able to represent syntactic notions and provability; different codings and choices produce non-unique Gödel sentences, so the construction depends on the formal setup and is not canonical beyond equivalence up to provable equivalence in richer meta-theories.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Sits between notions of semantic truth, syntactic provability, and paradoxical self-reference: it resembles the liar in form but differs because its construction is arithmetized and its undemonstrability follows from consistency rather than semantic paradox.

 

 

 

 

 





## Synthesis

Synthesis

A Gödel sentence is an arithmetized self-referential construction that states its own unprovability in a given formal theory; through diagonalization it turns syntactic coding into an explicit undecidable arithmetic sentence under the theory's consistency.