Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
From MaRDI portal
Publication:1322453
DOI10.1007/BF01275469zbMath0805.03046MaRDI QIDQ1322453
Publication date: 23 January 1995
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Kripke-Platek set theoryproof-theoretical ordinaladmissible ordinalsMahlo ordinalsordinal denotation systemrecursive Mahlo cardinals
Related Items
Proof theory of reflection, Relativized ordinal analysis: the case of power Kripke-Platek set theory, Induction-recursion and initial algebras., Recent Advances in Ordinal Analysis: Π12— CA and Related Systems, Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting), An ordinal analysis of stability, An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension, Theories and ordinals in proof theory, Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms, Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof-theoretic analysis of KPM
- Ordinal notations based on a weakly Mahlo cardinal
- Ein Wohlordnungsbeweis für das Ordinalzahlensystem T(J). (A proof of the wellordering of the ordinal number system T(J))
- A new system of proof-theoretic ordinal functions
- Ordinal notations based on a hierarchy of inaccessible cardinals
- Proof theory and ordinal analysis
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
- Provable wellorderings of formal theories for transfinitely iterated inductive definitions
- How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
