Proof Theoretic Analysis by Iterated Reflection
From MaRDI portal
Publication:4637223
DOI10.1007/978-3-319-22156-4_9zbMath1402.03079OpenAlexW2609272412MaRDI QIDQ4637223
Publication date: 18 April 2018
Published in: Turing’s Revolution (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22156-4_9
ordinal analysisreflection principlesTuring progressionspartial conservativityparameter-free induction
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof theory. The first step into impredicativity
- Interpretability of various extensions of arithmetic
- On the scheme of induction for bounded arithmetic formulas
- Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt
- A proof-theoretic analysis of collection
- Induction rules, reflection principles, and provably recursive functions
- Proof-theoretic analysis by iterated reflection
- Provability algebras and proof-theoretic ordinals. I
- Transfinite induction within Peano arithmetic
- Parameter free induction and provably total computable functions
- Arithmetization of metamathematics in a general setting
- The optimality of induction as an axiomatization of arithmetic
- Reflection Principles in Fragments of Peano Arithmetic
- On parameter free induction schemas
- Systems of predicative analysis
- Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- Existence and feasibility in arithmetic
- On n-quantifier induction
- Transfinite recursive progressions of axiomatic theories
This page was built for publication: Proof Theoretic Analysis by Iterated Reflection
