34 citations · 54 across the 14 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.LO2025
Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
Eike Neumann
We study the problem of deciding whether a point escapes a closed subset of under the iteration of a continuous map in the b…
math.LO2025★ 2 cited
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…