Proof-theoretic analysis of KPM
From MaRDI portal
Publication:803124
DOI10.1007/BF01621475zbMATH Open0727.03036OpenAlexW2064023341MaRDI QIDQ803124FDOQ803124
Authors: Michael Rathjen 
Publication date: 1991
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01621475
Recommendations
cut-eliminationconstructible setsproof-theoretical ordinalfirst recursive Mahlo ordinallocal predicativityordinal analysis of the formal system KPM of a Kripke-Platek set theoryramified set theory
Cites Work
- Title not available (Why is that?)
- Proof theory. An introduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ordinal notations based on a weakly Mahlo cardinal
- A new system of proof-theoretic ordinal functions
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
- Ordinal notations based on a hierarchy of inaccessible cardinals
- Proof theory and ordinal analysis
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- Title not available (Why is that?)
Cited In (35)
- Relativized ordinal analysis: the case of power Kripke-Platek set theory
- Simplified collapsing functions and their applications
- Inaccessibility in constructive set theory and type theory
- How to characterize provably total functions by local predicativity
- Ordinal notations based on a weakly Mahlo cardinal
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Epsilon substitution for \(ID_1\) via cut-elimination
- The strength of some Martin-Löf type theories
- Title not available (Why is that?)
- The constructive Hilbert program and the limits of Martin-Löf type theory
- Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
- Proof theory of reflection
- Induction-recursion and initial algebras.
- Proof theory and ordinal analysis
- Proof theory for theories of ordinals. I: Recursively Mahlo ordinals
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- An ordinal analysis of stability
- Reduction of finite and infinite derivations
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems
- Zur Beweistheorie Von KPM
- Theories and ordinals in proof theory
- Verificaton, falsification, and cancellation in KT
- An Upper Bound for the Proof-Theoretic Strength of Martin-Löf Type Theory with W-type and One Universe
- Functional interpretation of Aczel's constructive set theory
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory
- Wellordering proofs for metapredicative Mahlo
- Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM
- AN ORDINAL ANALYSIS OF ADMISSIBLE SET THEORY USING RECURSION ON ORDINAL NOTATIONS
- Proof Theory of Constructive Systems: Inductive Types and Univalence
- Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
- Monotone inductive definitions in explicit mathematics
- Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
This page was built for publication: Proof-theoretic analysis of KPM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803124)
