Ramsey's Theorem [166] captures the idea that total disorder is impossible: a sufficiently
large structure will always contain a large ordered substructure. A well-known special case …

Weihrauch Complexity in Computable Analysis Page 1 Chapter 11 Weihrauch Complexity in
Computable Analysis Vasco Brattka, Guido Gherardi and Arno Pauly Abstract We provide a …

The enterprise of comparing mathematical theorems according to their logical strength is an
active area in mathematical logic, with one of the most common frameworks for doing so …

We investigate the topological aspects of some algebraic computation models, in particular
the BSS-model. Our results can be seen as bounds on how different BSS-computability and …

In this paper we study the notion of first-order part of a computational problem, first
introduced in [17], which captures the “strongest computational problem with codomain N …

We study the uniform computational content of Ramsey's theorem in the Weihrauch lattice.
Our central results provide information on how Ramsey's theorem behaves under product …

Ordinal Computability discusses models of computation obtained by generalizing classical
models, such as Turing machines or register machines, to transfinite working time and …

Informally, a mathematical statement is robust if its strength is left unchanged under
variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's …

We introduce the notion of the first-order part of a problem in the Weihrauch degrees.
Informally, the first-order part of a problem P is the strongest problem with codomaixn ω that …

This paper is a contribution to the growing investigation of strong reducibilities between. The
last result also extends a prior result of Dzhafarov [9]. We introduce a number of new …