Every ^0_2 Polish space is computable topological
From MaRDI portal
Publication:6554707
Cites work
- A comparison of concepts from computable analysis and effective descriptive set theory
- An arithmetic analysis of closed surfaces
- Computability of Polish spaces up to homeomorphism
- Computable abelian groups
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable Stone spaces
- Computable Structure Theory
- Computable structures and the hyperarithmetical hierarchy
- Computable topological abelian groups
- COMPUTABLY COMPACT METRIC SPACES
- Degrees of non-computability of homeomorphism types of Polish spaces
- Descriptive set theory
- Elementary computable topology
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Hierarchies of Boolean algebras
- scientific article; zbMATH DE number 4156425 (Why is no real title available?)
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- scientific article; zbMATH DE number 2047478 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3200656 (Why is no real title available?)
- On computable metrization
- On the integral homology of finitely presented groups
- Recursive metric spaces
- Separating notions in effective topology
- Subgroups of finitely presented groups
- The Rice-Shapiro theorem in computable topology
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)