Coloring the rationals in reverse mathematics
DOI10.3233/COM-160067zbMATH Open1420.03026arXiv1508.00752OpenAlexW2963961606WikidataQ61308012 ScholiaQ61308012MaRDI QIDQ4601029FDOQ4601029
Authors: Emanuele Frittaion, Ludovic Patey
Publication date: 18 January 2018
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.00752
Recommendations
Computation over the reals, computable analysis (03D78) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80)
Cited In (7)
- On the Weihrauch degree of the additive Ramsey theorem over the rationals
- The uniform content of partial and linear orders
- Coloring trees in reverse mathematics
- Erdős-Moser and \(I \Sigma_2\)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
- Representation of the positive real numbers as sums of colored rational numbers
- Coloring terms to control equational reasoning
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)