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…
cs.LO2025
The equational theory of the Weihrauch lattice with (iterated) composition
Cécilia Pradic
We study the equational theory of the Weihrauch lattice with composition and iteration, meaning the collection of equations between terms built from variables, the lattice operatio…