2 papers
math.LO2025
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''…
math.LO2025
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…