Cohesive avoidance and strong reductions

DOI10.1090/S0002-9939-2014-12261-1zbMath1386.03055arXiv1212.0828MaRDI QIDQ5496327

Damir D. Dzhafarov

Publication date: 30 January 2015

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsRamsey's theorem for pairscohesive principle

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Related Items

Notions of robust information coding, Reduction games, provability and compactness, The uniform content of partial and linear orders, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Ramsey’s theorem for singletons and strong computable reducibility, ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM, Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective, Borel-Piecewise Continuous Reducibility for Uniformization Problems, THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS, The weakness of being cohesive, thin or free in reverse mathematics, Embeddings between well-orderings: computability-theoretic reductions, New bounds on the strength of some restrictions of Hindman's theorem, On uniform relationships between combinatorial problems, \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models, COH, SRT 2 2 , and multiple functionals, Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the strength of the finite intersection principle
• Infinite subsets of random sets of integers
• Recursion theory week. Proceedings of a conference held in Oberwolfach, Germany, March 19-25, 1989
• Upward closure and cohesive degrees
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Ramsey's theorem and cone avoidance
• The atomic model theorem and type omitting
• Generalized cohesiveness
• A cohesive set which is not high
• Jump equivalence of the Δ₂⁰ hyperimmune sets
• Sets with no subset of higher degree