1 citations · 1 across the 1 of their papers we have counts for
2 papers
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…
math.LO2024★ 1 cited
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…