On the Π1 1 -separation principle
From MaRDI portal
Publication:3545211
Recommendations
- Iterative forcing and hyperimmunity in reverse mathematics
- Iterative forcing and hyperimmunity in reverse mathematics
- The determinacy strength of \(\Pi_2^1\)-comprehension
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- The strength of the tree theorem for pairs in reverse mathematics
Cites work
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 3250555 (Why is no real title available?)
- Computable structures and the hyperarithmetical hierarchy
- Forcing with tagged trees
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Recursive Pseudo-Well-Orderings
Cited in
(9)- Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
- Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
- Iterative forcing and hyperimmunity in reverse mathematics
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Iterative forcing and hyperimmunity in reverse mathematics
- Transfinite recursion in higher reverse mathematics
This page was built for publication: On the Π1 1 -separation principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545211)
