Wellordering proofs for metapredicative Mahlo
From MaRDI portal
Recommendations
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- Ordinal diagrams for recursively Mahlo universes
- Proof-theoretic strengths of the well-ordering principles
- scientific article; zbMATH DE number 2204757
- Ein Wohlordnungsbeweis für das Ordinalzahlensystem T(J). (A proof of the wellordering of the ordinal number system T(J))
Cites work
- Constructivism in mathematics. An introduction. Volume I
- Fixed point theories and dependent choice
- scientific article; zbMATH DE number 3900744 (Why is no real title available?)
- Proof-theoretic analysis of KPM
- Systems of explicit mathematics with non-constructive -operator. II
- The proof-theoretic analysis of transfinitely iterated fixed point theories
- The strength of admissibility without foundation
- The strength of Martin-Löf type theory with a superuniverse. I
- The strength of Martin-Löf type theory with a superuniverse. II
- Universes in explicit mathematics
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
Cited in
(6)- The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- On the relationship between fixed points and iteration in admissible set theory without foundation
- Reflections on reflections in explicit mathematics
- A Note on (Meta)predicative Wellordering Proofs
This page was built for publication: Wellordering proofs for metapredicative Mahlo
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532614)