Proof-theoretic analysis of KPM
From MaRDI portal
Publication:803124
Recommendations
Cites work
- scientific article; zbMATH DE number 4039890 (Why is no real title available?)
- scientific article; zbMATH DE number 4079410 (Why is no real title available?)
- scientific article; zbMATH DE number 193575 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- A new system of proof-theoretic ordinal functions
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- Ordinal notations based on a hierarchy of inaccessible cardinals
- Ordinal notations based on a weakly Mahlo cardinal
- Proof theory and ordinal analysis
- Proof theory. An introduction
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
Cited in
(35)- Relativized ordinal analysis: the case of power Kripke-Platek set theory
- Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
- Simplified collapsing functions and their applications
- Inaccessibility in constructive set theory and type theory
- Ordinal notations based on a weakly Mahlo cardinal
- How to characterize provably total functions by local predicativity
- Epsilon substitution for \(ID_1\) via cut-elimination
- 1998 European Summer Meeting of the Association for Symbolic Logic
- The strength of some Martin-Löf type theories
- The constructive Hilbert program and the limits of Martin-Löf type theory
- scientific article; zbMATH DE number 1390277 (Why is no real title available?)
- Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
- Proof theory of reflection
- Induction-recursion and initial algebras.
- Proof theory for theories of ordinals. I: Recursively Mahlo ordinals
- Proof theory and ordinal analysis
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Proof theory of constructive systems: inductive types and univalence
- An ordinal analysis of stability
- Reduction of finite and infinite derivations
- A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- Zur Beweistheorie Von KPM
- Verificaton, falsification, and cancellation in KT
- Theories and ordinals in proof theory
- 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
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
- 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
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
- Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
- Monotone inductive definitions in explicit mathematics
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)
