2 citations · 9 across the 7 of their papers we have counts for
5 papers · 1 filter
Computably discrete represented spaces
Eike Neumann, Arno Pauly, Cécilia Pradic +1
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial s…
More on the indivisibility of
Arno Pauly
We study the complexity of the computational task ``Given a colouring , find a monochromatic such that $(S,<) \cong (\mathbb…
Sequential discontinuity and first-order problems
Arno Pauly, Giovanni Soldà
We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order…
The weakness of finding descending sequences in ill-founded linear orders
Jun Le Goh, Arno Pauly, Manlio Valenti
We explore the Weihrauch degree of the problems ``find a bad sequence in a non-well quasi order'' () and ``find a descending sequence in an ill-founded linear order''…
Minimal covers in the Weihrauch degrees
Steffen Lempp, Joseph S. Miller, Arno Pauly +2
In this paper, we study the existence of minimal covers and strong minimal covers in the Weihrauch degrees. We characterize when a problem is a minimal cover or strong minimal…