Abstract
We show that the property of being locally compact for computable Polish metric spaces is \(\varPi ^1_1\) complete. We verify that local compactness for Polish metric spaces can be expressed by a sentence in \(L_{\omega _1, \omega }\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kechris, A.S.: Classical descriptive set theory, vol. 156. Springer, New York (1995)
Melnikov, A.G., Nies, A.: The Classification Problem for Compact Computable Metric Spaces. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 320–328. Springer, Heidelberg (2013)
Naulin, R., Aylwin, C.: On the complexity of the family of compact subsets of \(\mathbb{Q}\). Notas de Mat. 5(2), 283 (2009)
Acknowledgment
This work was carried out at the Hausdorff Institute for Mathematics in October 2013, and at the Research Centre Whiritoa in December 2014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Nies, A., Solecki, S. (2015). Local Compactness for Computable Polish Metric Spaces is \(\varPi ^1_1\)-complete. In: Beckmann, A., Mitrana, V., Soskova, M. (eds) Evolving Computability. CiE 2015. Lecture Notes in Computer Science(), vol 9136. Springer, Cham. https://doi.org/10.1007/978-3-319-20028-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-20028-6_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20027-9
Online ISBN: 978-3-319-20028-6
eBook Packages: Computer ScienceComputer Science (R0)