Computably discrete represented spaces

DOI10.1007/978-3-031-95908-0_25MaRDI QIDQ6897640zbMATH OpenFDO

Authors Eike Neumann, Arno Pauly, Cécilia Pradic, Manlio Valenti

Publication date 19 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-95908-0_25

zbMATH Keywords

computable analysistopology

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A survey on universal computably enumerable equivalence relations
• Computability on quasi-Polish spaces
• Computably discrete represented spaces
• Computably enumerable equivalence relations
• Computably regular topological spaces
• On the topological aspects of the theory of represented spaces
• Overt choice
• Quasi-Polish spaces
• Turing computability. Theory and applications
• Universal computably enumerable equivalence relations

Cited in

(2)

• Computably discrete represented spaces
• Effective bases and notions of effective second countability in computable analysis

This page was built for publication: Computably discrete represented spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897640)