34 citations · 54 across the 14 of their papers we have counts for
1 paper · 2 filters
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…