The open and clopen Ramsey theorems in the Weihrauch lattice

03/09/2020
by   Alberto Marcone, et al.
0

We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to ATR_0 from the point of view of reverse mathematics, there is not a canonical way to phrase them as multivalued functions. We identify 8 different multivalued functions (5 corresponding to the open Ramsey theorem and 3 corresponding to the clopen Ramsey theorem) and study their degree from the point of view of Weihrauch, strong Weihrauch and arithmetic Weihrauch reducibility. In particular one of our functions turns out to be strictly stronger than any previously studied multivalued functions arising from statements around ATR_0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2023

On the Weihrauch degree of the additive Ramsey theorem

We characterize the strength, in terms of Weihrauch degrees, of certain ...
research
12/21/2020

Ergodic Theorems for PSPACE functions and their converses

We initiate the study of effective pointwise ergodic theorems in resourc...
research
09/12/2020

Kunneth Theorems for Vietoris-Rips Homology

We prove a Kunneth theorem for the Vietoris-Rips homology and cohomology...
research
09/22/2021

Relative-error stability of numerical algorithms

We formalize the definition of a stable algorithm that is (i) adapted to...
research
05/10/2019

Nets and Reverse Mathematics, a pilot study

Nets are generalisations of sequences involving possibly uncountable ind...
research
12/04/2018

Searching for an analogue of ATR in the Weihrauch lattice

There are close similarities between the Weihrauch lattice and the zoo o...
research
02/18/2002

Nonmonotonic Reasoning, Preferential Models and Cumulative Logics

Many systems that exhibit nonmonotonic behavior have been described and ...

Please sign up or login with your details

Forgot password? Click here to reset