The uniform content of partial and linear orders
DOI10.1016/j.apal.2016.11.010zbMath1390.03040arXiv1605.06164OpenAlexW2962747934MaRDI QIDQ2400498
Eric P. Astor, Jacob Suggs, Damir D. Dzhafarov, D. Reed Solomon
Publication date: 29 August 2017
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.06164
stableforcingcomputability theoryreverse mathematicsWeihrauch reducibilityCACeffective combinatoricsADSADCGeneral-SADCGeneral-SADSramseySADCSADSSCACWSCAC
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) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Genericity for Mathias forcing over general Turing ideals
- The weakness of being cohesive, thin or free in reverse mathematics
- Borel complexity and computability of the Hahn-Banach theorem
- The uniform content of partial and linear orders
- Generics for computable Mathias forcing
- On the strength of Ramsey's theorem for pairs
- On uniform relationships between combinatorial problems
- Turing Computability
- Ramsey’s theorem for singletons and strong computable reducibility
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
- On notions of computability-theoretic reduction between Π21 principles
- Slicing the Truth
- On the existence of a connected component of a graph
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
- Stability and posets
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
- Coloring the rationals in reverse mathematics
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
- Cohesive avoidance and strong reductions
- Ramsey's theorem and recursion theory
This page was built for publication: The uniform content of partial and linear orders