A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION
DOI10.1017/JSL.2017.71zbMath1467.03031OpenAlexW2913433379WikidataQ128416892 ScholiaQ128416892MaRDI QIDQ4628680
Publication date: 15 March 2019
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2017.71
proof-theoretic ordinalHardy hierarchypartial conservationprovably total functionBuchholz's finite code of infinitary proofinfinitary semi-formal systemMints's repetition rule
Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15) Relative consistency and interpretations (03F25)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From hierarchies to well-foundedness
- Proof theory. The first step into impredicativity
- A consistency proof of a system including Feferman's \(ID_{\xi}\) by Takeuti's reduction method
- Nested recursion
- Finite investigations of transfinite derivations
- Proof-theoretic analysis by iterated reflection
- Ordinal Analysis and the Infinite Ramsey Theorem
- A Model-Theoretic Approach to Ordinal Analysis
- Intuitionistic Fixed Point Theories for Strictly Positive Operators
- Systems of predicative analysis, II: Representations of ordinals
This page was built for publication: A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION