Iterative forcing and hyperimmunity in reverse mathematics

DOI10.1007/978-3-319-20028-6_30MaRDI QIDQ3195708zbMATH OpenOpenAlexFDO

Authors Ludovic Patey

Publication date 20 October 2015

Published in Evolving Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.07709

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Abstract: The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing technique for iterating a computable non-reducibility in order to separate theorems over omega-models. In this paper, we present a modularized version of their framework in terms of preservation of hyperimmunity and show that it is powerful enough to obtain the same separations results as Wang did with his notion of preservation of definitions.

Recommendations

• Iterative forcing and hyperimmunity in reverse mathematics
• On the Π₁ ¹ -separation principle
• Partial orders and immunity in reverse mathematics
• Partial orders and immunity in reverse mathematics
• Controlling iterated jumps of solutions to combinatorial problems

Cites work

• ∏ 0 1 Classes and Degrees of Theories
• A cohesive set which is not high
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Controlling iterated jumps of solutions to combinatorial problems
• Degrees bounding principles and universal instances in reverse mathematics
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• scientific article; zbMATH DE number 2236628 (Why is no real title available?)
• On notions of computability-theoretic reduction between Π21 principles
• On the strength of Ramsey's theorem for pairs
• Ramsey-type graph coloring and diagonal non-computability
• Separating principles below \(\mathsf{WKL}_0\)
• Separating principles below Ramsey's theorem for pairs
• Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• Some logically weak Ramseyan theorems
• The atomic model theorem and type omitting
• The strength of infinitary Ramseyan principles can be accessed by their densities
• The strength of the rainbow Ramsey Theorem
• The thin set theorem for pairs implies DNR
• The weakness of being cohesive, thin or free in reverse mathematics

Cited in

(14)

• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• Dominating the Erdős-Moser theorem in reverse mathematics
• The reverse mathematics of non-decreasing subsequences
• Controlling iterated jumps of solutions to combinatorial problems
• The strength of the tree theorem for pairs in reverse mathematics
• Partial orders and immunity in reverse mathematics
• On the Π₁ ¹ -separation principle
• Iterative forcing and hyperimmunity in reverse mathematics
• On the logical strengths of partial solutions to mathematical problems
• The weakness of being cohesive, thin or free in reverse mathematics
• Ramsey-like theorems and moduli of computation
• Thin set theorems and cone avoidance
• Open questions about Ramsey-type statements in reverse mathematics
• Erdős-Moser and I _2

This page was built for publication: Iterative forcing and hyperimmunity in reverse mathematics

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