On the Π1 1 -separation principle

DOI10.1002/MALQ.200710049zbMATH Open1155.03042OpenAlexW1568399937MaRDI QIDQ3545211FDOQ3545211

Authors: Antonio Montalbán 

Publication date: 10 December 2008

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200710049

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

zbMATH Keywords

separationreverse mathematicshyperarithmetic analysis

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Title not available (Why is that?)
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Recursive Pseudo-Well-Orderings
• Forcing with tagged trees
• Title not available (Why is that?)

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 Π₁ ¹ -separation principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545211)