Every \(\Delta^0_2\) Polish space is computable topological
From MaRDI portal
Publication:6554707
DOI10.1090/PROC/16797MaRDI QIDQ6554707
Nikolay Bazhenov, Keng Meng Ng, Alexander Melnikov
Publication date: 13 June 2024
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Computable structure theory, computable model theory (03C57) Computation over the reals, computable analysis (03D78)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the integral homology of finitely presented groups
- Computable structures and the hyperarithmetical hierarchy
- Computable topological abelian groups
- Degrees of non-computability of homeomorphism types of Polish spaces
- Computable abelian groups
- Subgroups of finitely presented groups
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- A comparison of concepts from computable analysis and effective descriptive set theory
- The Rice-Shapiro theorem in Computable Topology
- On Computable Metrization
- Computable Structure Theory
- Computable Algebra, General Theory and Theory of Computable Fields
- Recursive metric spaces
- Hierarchies of Boolean algebras
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
- Computable Stone spaces
- Separating notions in effective topology
- COMPUTABLY COMPACT METRIC SPACES
- An arithmetic analysis of closed surfaces
This page was built for publication: Every \(\Delta^0_2\) Polish space is computable topological
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554707)
