RELATIVE PREDICATIVITY AND DEPENDENT RECURSION IN SECOND-ORDER SET THEORY AND HIGHER-ORDER THEORIES

DOI10.1017/jsl.2014.28zbMath1353.03073OpenAlexW2143083142MaRDI QIDQ2933671

Kentaro Sato

Publication date: 5 December 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/61784/1/sat12.pdf

zbMATH Keywords

second-order set theoryhigher-order number theoryautonomous progression of autonomous progressiondependent transfinite recursionrelative predicativity

Mathematics Subject Classification ID

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)

Related Items

Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts, Open determinacy for class games, VARIETIES OF CLASS-THEORETIC POTENTIALISM, A few more dissimilarities between second-order arithmetic and set theory, Classes and truths in set theory, From hierarchies to well-foundedness, Full and hat inductive definitions are equivalent in NBG, Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives, Deflationism beyond arithmetic, MINIMUM MODELS OF SECOND-ORDER SET THEORIES, THE EXACT STRENGTH OF THE CLASS FORCING THEOREM, A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection, FINITIST AXIOMATIC TRUTH

Cites Work

• Unnamed Item
• From hierarchies to well-foundedness