Mathematical logic and foundations Proof theory Concept
Proof-theoretic ordinal
Builds on Ordinal numberPeano axiomsTransfinite inductionEpsilon nought
Summary
The proof-theoretic ordinal of a formal theory measures how much transfinite induction the theory can prove. It is the supremum of the order types of the computable well-orderings that the theory proves to be well-founded. It is a countable ordinal, and it gives a scale on which theories can be compared by strength. For Peano arithmetic it is epsilon nought.
Reading path
To understand this page from the ground up, read these 27 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Countable set concept
- Element definition
- Ordinal number concept
- Peano axioms concept
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Preorder definition
- Partial order definition
- Least element definition
- Minimal element definition
- Total order definition
- Well-founded relation definition
- Well-order definition
- Ordinal number definition
- Transfinite induction statement
- Epsilon nought object
- Proof-theoretic ordinal concept
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | C72RBH0CDR |
|---|---|
| URI | m2://C72RBH0CDR |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03F15, 03F30 |
| Specializes | Ordinal number |
| Uses | Ordinal number, Peano axioms, Transfinite induction, Epsilon nought |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.