Relative predicativity and dependent recursion in second-order set theory and higher-order theories
From MaRDI portal
Publication:2933671
Recommendations
Cites work
Cited in
(14)- VARIETIES OF CLASS-THEORETIC POTENTIALISM
- 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 few more dissimilarities between second-order arithmetic and set theory
- A new model construction by making a detour via intuitionistic theories. IV: A closer connection between \(\mathrm{KP} \omega\) and \(\mathrm{BI}\).
- FINITIST AXIOMATIC TRUTH
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)