English

On the Weihrauch degree of the additive Ramsey theorem

Logic in Computer Science 2023-12-05 v2 Logic

Abstract

We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the existence of almost-homogeneous sets for colourings of pairs of rationals respectively natural numbers satisfying properties determined by some additional algebraic structure on the set of colours. In the context of reverse mathematics, most of the principles we study are equivalent to Σ20\Sigma^0_2-induction over RCA0\mathrm{RCA}_0. The associated problems in the Weihrauch lattice are related to TCN\mathrm{TC}_\mathbb{N}^*, (LPO)(\mathrm{LPO}')^* or their product, depending on their precise formalizations.

Keywords

Cite

@article{arxiv.2301.02833,
  title  = {On the Weihrauch degree of the additive Ramsey theorem},
  author = {Arno Pauly and Cécilia Pradic and Giovanni Solda},
  journal= {arXiv preprint arXiv:2301.02833},
  year   = {2023}
}