Effectiveness for the Dual Ramsey Theorem
@article{Dzhafarov2017EffectivenessFT, title={Effectiveness for the Dual Ramsey Theorem}, author={Damir D. Dzhafarov and S. Flood and R. Solomon and L. Westrick}, journal={arXiv: Logic}, year={2017} }
We analyze the Dual Ramsey Theorem for $k$ partitions and $\ell$ colors ($\mathsf{DRT}^k_\ell$) in the context of reverse math, effective analysis, and strong reductions. Over $\mathsf{RCA}_0$, the Dual Ramsey Theorem stated for Baire colorings is equivalent to the statement for clopen colorings and to a purely combinatorial theorem $\mathsf{cDRT}^k_\ell$.
When the theorem is stated for Borel colorings and $k\geq 3$, the resulting principles are essentially relativizations of $\mathsf{cDRT}^k_… CONTINUE READING
Figures from this paper
Figures
5 Citations
References
SHOWING 1-10 OF 18 REFERENCES
Effectiveness for infinite variable words and the Dual Ramsey Theorem
- Mathematics, Computer Science
- Arch. Math. Log.
- 2004
- 5
- PDF
On notions of computability-theoretic reduction between Π21 principles
- Mathematics, Computer Science
- J. Math. Log.
- 2016
- 27
- PDF
Strong Reductions between Combinatorial Principles
- Mathematics, Computer Science
- J. Symb. Log.
- 2016
- 21
- PDF
On the role of the collection principle for Sigma^0_2-formulas in second-order reverse mathematics
- Mathematics
- 2010
- 41
- Highly Influential
- PDF