6 citations · 11 across the 5 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
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…
math.LO2019
Cantor-Bernstein implies Excluded Middle
Cécilia Pradic, Chad E. Brown
We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven ass…