A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction

DOI10.1017/JSL.2017.71MaRDI QIDQ4628680zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

proof-theoretic ordinalHardy hierarchypartial conservationprovably total functionBuchholz's finite code of infinitary proofinfinitary semi-formal systemMints's repetition rule

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1088186 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• A Model-Theoretic Approach to Ordinal Analysis
• A consistency proof of a system including Feferman's \(ID_{\xi}\) by Takeuti's reduction method
• Finite investigations of transfinite derivations
• From hierarchies to well-foundedness
• Intuitionistic Fixed Point Theories for Strictly Positive Operators
• Nested recursion
• Ordinal analysis and the infinite Ramsey theorem
• Proof theory. The first step into impredicativity
• Proof-theoretic analysis by iterated reflection
• Subsystems of second order arithmetic
• Systems of predicative analysis, II: Representations of ordinals

Cited in

(11)

• Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
• A marriage of Brouwer's intuitionism and Hilbert's finitism. I: Arithmetic
• 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
• Predicative collapsing principles
• A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection
• The model-theoretic ordinal analysis of theories of predicative strength
• FINITIST AXIOMATIC TRUTH
• Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts
• The proof-theoretic analysis of transfinitely iterated quasi least fixed points

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)