Coloring the rationals in reverse mathematics

DOI10.3233/COM-160067zbMath1420.03026arXiv1508.00752OpenAlexW2963961606WikidataQ61308012 ScholiaQ61308012MaRDI QIDQ4601029

Ludovic Patey, Emanuele Frittaion

Publication date: 18 January 2018

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsRamsey theoremcomputable reduction

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Computation over the reals, computable analysis (03D78)

Related Items (4)

The uniform content of partial and linear orders ⋮ Coloring trees in reverse mathematics ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ On the Weihrauch degree of the additive Ramsey theorem over the rationals

This page was built for publication: Coloring the rationals in reverse mathematics