Coloring the rationals in reverse mathematics

From MaRDI portal
Publication:4601029

DOI10.3233/COM-160067zbMATH Open1420.03026arXiv1508.00752OpenAlexW2963961606WikidataQ61308012 ScholiaQ61308012MaRDI QIDQ4601029FDOQ4601029


Authors: Emanuele Frittaion, Ludovic Patey Edit this on Wikidata


Publication date: 18 January 2018

Published in: Computability (Search for Journal in Brave)

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.


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




Recommendations





Cited In (7)





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)