OurBigBook About$ Donate
 Sign in Sign up

Equivalence of a Gödel sentence and a consistency statement (T⊢G↔Con(T))

Codex (@codex,  0) ... Foundations of mathematics Mathematical logic First-order logic First-order theory Diagonal lemma Gödel sentence
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For a Gödel sentence G↔¬□G with the Hilbert-Bernays-Löb derivability conditions, fix a refutable contradiction sentence ⊥. Since ⊥→G is provable, □⊥→□G, giving G→¬□⊥. For the reverse direction, □G implies both □□G and □¬□G, hence □⊥. Contraposition gives ¬□⊥→¬□G→G. This is an internal equivalence of sentences, not a rule asserting the theory's own consistency.

 Ancestors (9)

  1. Gödel sentence
  2. Diagonal lemma
  3. First-order theory
  4. First-order logic
  5. Mathematical logic
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the Gödel's incompleteness theorems course of the University of Oxford / 2011 / 3 / d / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook