A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction
DOI10.1017/JSL.2017.71zbMATH Open1467.03031OpenAlexW2913433379WikidataQ128416892 ScholiaQ128416892MaRDI QIDQ4628680FDOQ4628680
Authors: Sato Kentaro 
Publication date: 15 March 2019
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2017.71
Recommendations
- The proof-theoretic analysis of transfinitely iterated fixed point theories
- Proof-theoretic analysis by iterated reflection
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory
- Second order theories with ordinals and elementary comprehension
- Proof theoretic analysis by iterated reflection
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)
Cites Work
- Subsystems of second order arithmetic
- Title not available (Why is that?)
- Proof-theoretic analysis by iterated reflection
- Title not available (Why is that?)
- Proof theory. The first step into impredicativity
- Systems of predicative analysis, II: Representations of ordinals
- A Model-Theoretic Approach to Ordinal Analysis
- Intuitionistic Fixed Point Theories for Strictly Positive Operators
- From hierarchies to well-foundedness
- Nested recursion
- Finite investigations of transfinite derivations
- Ordinal analysis and the infinite Ramsey theorem
- A consistency proof of a system including Feferman's \(ID_{\xi}\) by Takeuti's reduction method
Cited In (11)
- A marriage of Brouwer's intuitionism and Hilbert's finitism. I: Arithmetic
- A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection
- Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts
- Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
- Predicative collapsing principles
- Ordinal analyses for monotone and cofinal transfinite inductions
- Normal forms for elementary patterns
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points
- The model-theoretic ordinal analysis of theories of predicative strength
- FINITIST AXIOMATIC TRUTH
This page was built for publication: A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628680)
