Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete

DOI10.1007/978-3-319-20028-6_29zbMath1461.03045OpenAlexW940564044MaRDI QIDQ3195707

Slawomir Solecki, André Nies

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_29

Mathematics Subject Classification ID

Descriptive set theory (03E15) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Related Items (7)

Metric Scott analysis ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Degrees of and lowness for isometric isomorphism ⋮ On isometry and isometric embeddability between ultrametric Polish spaces ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computable analysis and classification problems

Cites Work

• The Classification Problem for Compact Computable Metric Spaces
• Unnamed Item
• Unnamed Item

This page was built for publication: Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete