DeepAI AI Chat
Log In Sign Up

On the Weihrauch degree of the additive Ramsey theorem

by   Arno Pauly, et al.
Swansea University

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 Σ^0_2-induction over RCA_0. The associated problems in the Weihrauch lattice are related to TC_ℕ^*, (LPO')^* or their product, depending on their precise formalizations.


page 1

page 2

page 3

page 4


The open and clopen Ramsey theorems in the Weihrauch lattice

We investigate the uniform computational content of the open and clopen ...

Lifting countable to uncountable mathematics

Ordinary, i.e.non-set theoretic mathematics is generally formalised in s...

When is an automatic set an additive basis?

We characterize those k-automatic sets S of natural numbers that form an...

What is important about the No Free Lunch theorems?

The No Free Lunch theorems prove that under a uniform distribution over ...

Searching for an analogue of ATR in the Weihrauch lattice

There are close similarities between the Weihrauch lattice and the zoo o...

Nets and Reverse Mathematics, a pilot study

Nets are generalisations of sequences involving possibly uncountable ind...

Impossibility Results in AI: A Survey

An impossibility theorem demonstrates that a particular problem or set o...