Math 2.0

Mathematical logic and foundations Arithmetic and incompleteness Theorem

Löb's theorem

Builds on Peano axiomsGödel numberingSentenceTheoryComputably enumerable set

Statement

Let TT be a theory in the language of arithmetic that contains the Peano axioms and whose set of axioms is computably enumerable. Let ProvT(x)\mathrm{Prov}_T(x) be the standard provability predicate of TT for a Gödel numbering. For every sentence φ\varphi, if T⊢ProvT(⌜φ⌝)→φT \vdash \mathrm{Prov}_T(\ulcorner \varphi \urcorner) \to \varphi, then T⊢φT \vdash \varphi.

Remarks

Proof idea: by the diagonal lemma there is ψ\psi with T⊢ψ↔(ProvT(⌜ψ⌝)→φ)T \vdash \psi \leftrightarrow (\mathrm{Prov}_T(\ulcorner \psi \urcorner) \to \varphi). The derivability conditions of ProvT\mathrm{Prov}_T, which TT proves, give T⊢ProvT(⌜ψ⌝)→ProvT(⌜φ⌝)T \vdash \mathrm{Prov}_T(\ulcorner \psi \urcorner) \to \mathrm{Prov}_T(\ulcorner \varphi \urcorner). With the hypothesis this yields T⊢ProvT(⌜ψ⌝)→φT \vdash \mathrm{Prov}_T(\ulcorner \psi \urcorner) \to \varphi, hence T⊢ψT \vdash \psi, hence T⊢ProvT(⌜ψ⌝)T \vdash \mathrm{Prov}_T(\ulcorner \psi \urcorner), and finally T⊢φT \vdash \varphi.

Example: take φ\varphi to be 0=S00 = S0. If TT proved Con(T)\mathrm{Con}(T), that is, ¬ProvT(⌜0=S0⌝)\neg \mathrm{Prov}_T(\ulcorner 0 = S0 \urcorner), then TT would prove ProvT(⌜0=S0⌝)→0=S0\mathrm{Prov}_T(\ulcorner 0 = S0 \urcorner) \to 0 = S0, and so T⊢0=S0T \vdash 0 = S0. So a consistent TT does not prove its own consistency, which is the second of Gödel's incompleteness theorems. Another consequence: the sentence that says "I am provable" is provable, which answers a question of Henkin.

Going deeper

For a student

Löb's theorem generalizes the second incompleteness theorem, as the example shows. Its formalized version, □(□p→p)→□p\square(\square p \to p) \to \square p, is the characteristic axiom of the modal provability logic 𝖦𝖫\mathsf{GL}, read with □\square as "it is provable in TT that".

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Computably enumerable set concept
  2. Gödel numbering concept
  3. Peano axioms concept
  4. Sentence concept
  5. Theory concept
  6. Löb's theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Löb's_theorem
About this page
Tag3HD30YG3DG
URIm2://3HD30YG3DG
Kindstatement, theorem
WritingW0 stub
MSC03F40, 03F45
StatusThis copy of the site has no build data. Run m2 status 3HD30YG3DG.
AboutGödel numbering
UsesPeano axioms, Gödel numbering, Sentence, Theory, Computably enumerable set
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.