Proof theory of reflection
From MaRDI portal
Publication:1332853
DOI10.1016/0168-0072(94)90074-4zbMath0813.03037OpenAlexW2033008594MaRDI QIDQ1332853
Publication date: 7 June 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)90074-4
cut-eliminationordinal analysisordinal notation systemproof-theoretic ordinalramified set theoryconstructible set hierarchyinfinitary proof systemKripke-Platek set theory with \(\Pi_ 3\)-reflection
Cut-elimination and normal-form theorems (03F05) Recursive ordinals and ordinal notations (03F15) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items
Proof theory for theories of ordinals. II: \(\Pi_{3}\)-reflection, Well-Ordering Principles in Proof Theory and Reverse Mathematics, Ordinal arithmetic based on Skolem hulling, Relativized ordinal analysis: the case of power Kripke-Platek set theory, Set-theoretic reflection is equivalent to induction over well-founded classes, A Model-Theoretic Approach to Ordinal Analysis, 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, Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory, On Relating Theories: Proof-Theoretical Reduction, An ordinal analysis of stability, An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension, Theories and ordinals in proof theory, Pure \(\Sigma_2\)-elementarity beyond the core, A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal, Iterated Inductive Definitions Revisited, Deflationism beyond arithmetic, Possible-worlds semantics for modal notions conceived as predicates, A Buchholz derivation system for the ordinal analysis of KP + Π3-reflection, PROOF THEORY OF WEAK COMPACTNESS, A SIMPLIFIED ORDINAL ANALYSIS OF FIRST-ORDER REFLECTION, A Glimpse of $$ \sum_{3} $$-elementarity, Zur Beweistheorie von KP+ $$ \varPi_{3} $$-Ref, Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe, The constructive Hilbert program and the limits of Martin-Löf type theory
Cites Work
- Proof-theoretic analysis of KPM
- Ordinal notations based on a weakly Mahlo cardinal
- Proof theory. 2nd ed
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
- Proof theory. An introduction
- Proof theory and ordinal analysis
- Notation systems for infinitary derivations
- Consistency proofs of subsystems of classical analysis
- Second order arithmetic and related topics
- How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
- Systems of predicative analysis, II: Representations of ordinals
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item