Mathematical logic and foundations Definition
Ordinal analysis
Builds on Proof-theoretic ordinalProof-theoretic ordinalPeano axiomsEpsilon noughtTransfinite induction
Definition
Let be a recursively axiomatized theory that contains elementary arithmetic. An ordinal analysis of is the determination of its proof-theoretic ordinal . It consists of three parts.
- A computable notation system: a computable well-order on a set of codes in , whose order type is an ordinal .
- A lower bound: for each , a proof in of transfinite induction along the initial segment of of order type .
- An upper bound: a proof that does not prove transfinite induction along itself. More precisely, each computable well-order that proves well-founded has order type below .
Then .
Remarks
Example: Gentzen's analysis of Peano arithmetic uses the Cantor normal forms below epsilon nought as notation system, and gives . The upper bound comes from a cut-elimination argument for PA, together with transfinite induction up to . Non-example: a proof that is consistent, by itself, is not an ordinal analysis, because it gives no ordinal. The upper bound is usually proved in a weak base theory together with transfinite induction along . This also gives a proof of the consistency of in that base theory.
Reading path
To understand this page from the ground up, read these 30 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Computable function concept
- 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
- Transfinite induction statement
- Ordinal number definition
- Epsilon nought object
- Proof-theoretic ordinal definition
- Proof-theoretic ordinal concept
- Ordinal analysis definition
Further reading
About this page
| Tag | 57PTMS2ADY |
|---|---|
| URI | m2://57PTMS2ADY |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03F15, 03F05 |
| Defines | Ordinal analysis |
| Uses | Proof-theoretic ordinal, Proof-theoretic ordinal, Peano axioms, Epsilon nought, Transfinite induction |
| 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.