Coloring the rationals in reverse mathematics
From MaRDI portal
Publication:4601029
Abstract: Ramsey's theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In this paper, we study a strengthening of Ramsey's theorem for pairs due to Erdos and Rado, which states that every 2-coloring of the pairs of rationals has either an infinite 0-homogeneous set or a 1-homogeneous set of order type eta, where eta is the order type of the rationals. This theorem is a natural candidate to lie strictly between the arithmetic comprehension axiom and Ramsey's theorem for pairs. This Erdos-Rado theorem, like the tree theorem for pairs, belongs to a family of Ramsey-type statements whose logical strength remains a challenge.
Recommendations
Cited in
(7)- The uniform content of partial and linear orders
- Coloring terms to control equational reasoning
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
- Coloring trees in reverse mathematics
- Representation of the positive real numbers as sums of colored rational numbers
- On the Weihrauch degree of the additive Ramsey theorem over the rationals
- Erdős-Moser and \(I \Sigma_2\)
This page was built for publication: Coloring the rationals in reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601029)