Ordinal diagrams for recursively Mahlo universes
From MaRDI portal
Publication:1576592
DOI10.1007/s001530050153zbMath0977.03030OpenAlexW2063028251MaRDI QIDQ1576592
Publication date: 9 January 2002
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001530050153
ordinal diagramsproof-theoretic ordinalproof-theoretic strength of subsystems of analysisrecursively Mahlo ordinal
Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)
Related Items (max. 100)
Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π20-operators ⋮ Proof theory for theories of ordinals. I: Recursively Mahlo ordinals ⋮ Wellfoundedness proofs by means of non-monotonic inductive definitions. II: First order operators ⋮ Wellfoundedness proof with the maximal distinguished set ⋮ A SIMPLIFIED ORDINAL ANALYSIS OF FIRST-ORDER REFLECTION ⋮ Epsilon substitution method for \([\Pi^0_1,\Pi^0_1\)-FIX] ⋮ Cut-Elimination for SBL
This page was built for publication: Ordinal diagrams for recursively Mahlo universes
