Cohesive avoidance and strong reductions
From MaRDI portal
Publication:5496327
DOI10.1090/S0002-9939-2014-12261-1zbMath1386.03055arXiv1212.0828MaRDI QIDQ5496327
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
03B30: Foundations of classical theories (including reverse mathematics)
05D10: Ramsey theory
03D80: Applications of computability and recursion theory
03F35: Second- and higher-order arithmetic and fragments
Related Items
ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM, COH, SRT 2 2 , and multiple functionals, Weihrauch Complexity in Computable Analysis, Reduction games, provability and compactness, Notions of robust information coding, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective, 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, \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models, The uniform content of partial and linear orders, On uniform relationships between combinatorial problems, Ramsey’s theorem for singletons and strong computable reducibility, Borel-Piecewise Continuous Reducibility for Uniformization Problems, THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS
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 Δ20 hyperimmune sets
- Sets with no subset of higher degree
