Mathematical logic and foundations Arithmetic and incompleteness Theorem
Löb's theorem
Builds on Peano axiomsGödel numberingSentenceTheoryComputably enumerable set
Statement
Let be a theory in the language of arithmetic that contains the Peano axioms and whose set of axioms is computably enumerable. Let be the standard provability predicate of for a Gödel numbering. For every sentence , if , then .
Remarks
Proof idea: by the diagonal lemma there is with . The derivability conditions of , which proves, give . With the hypothesis this yields , hence , hence , and finally .
Example: take to be . If proved , that is, , then would prove , and so . So a consistent 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, , is the characteristic axiom of the modal provability logic , read with as "it is provable in 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
- no evidence level
- Computably enumerable set concept
- Gödel numbering concept
- Peano axioms concept
- Sentence concept
- Theory concept
- Löb's theorem statement
Further reading
About this page
| Tag | 3HD30YG3DG |
|---|---|
| URI | m2://3HD30YG3DG |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 03F40, 03F45 |
| Status | This copy of the site has no build data. Run m2 status 3HD30YG3DG. |
| About | Gödel numbering |
| Uses | Peano axioms, Gödel numbering, Sentence, Theory, Computably enumerable set |
| Same as | |
| Changed | 2 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.