Relative predicativity and dependent recursion in second-order set theory and higher-order theories
DOI10.1017/JSL.2014.28zbMATH Open1353.03073OpenAlexW2143083142MaRDI QIDQ2933671FDOQ2933671
Authors: Kentaro Sato 
Publication date: 5 December 2014
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://boris.unibe.ch/61784/1/sat12.pdf
Recommendations
second-order set theoryhigher-order number theoryautonomous progression of autonomous progressiondependent transfinite recursionrelative predicativity
Foundations of classical theories (including reverse mathematics) (03B30) Nonclassical and second-order set theories (03E70) Second- and higher-order arithmetic and fragments (03F35) Relative consistency and interpretations (03F25)
Cites Work
Cited In (14)
- Classes and truths in set theory
- 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
- Minimum models of second-order set theories
- Open determinacy for class games
- Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
- From hierarchies to well-foundedness
- Full and hat inductive definitions are equivalent in NBG
- The exact strength of the class forcing theorem
- Deflationism beyond arithmetic
- A new model construction by making a detour via intuitionistic theories. IV: A closer connection between \(\mathrm{KP} \omega\) and \(\mathrm{BI}\).
- A few more dissimilarities between second-order arithmetic and set theory
- FINITIST AXIOMATIC TRUTH
- VARIETIES OF CLASS-THEORETIC POTENTIALISM
This page was built for publication: Relative predicativity and dependent recursion in second-order set theory and higher-order theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933671)
