Author:
GREGORIADES VASSILIOS,KISPÉTER TAMÁS,PAULY ARNO
Abstract
Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy.As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference38 articles.
1. Pauly A. (2015a). Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. arXiv 1501.00386.
2. First level borel functions and isomorphisms;Jayne;Journal de Mathématiques Pures et Appliqués,1982
3. Computable Analysis
4. Real Hypercomputation and Continuity
5. Motto Ros L. , Schlicht P. and Selivanov V. (2014). Wadge-like reducibilities on arbitrary quasi-polish spaces. Mathematical Structures in Computer Science 1–50, http://journals.cambridge.org/article_S0960129513000339. ArXiv 1204.5338.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Every Δ⁰₂ Polish space is computable topological;Proceedings of the American Mathematical Society;2024-05-07
2. DEGREE SPECTRA OF HOMEOMORPHISM TYPE OF COMPACT POLISH SPACES;The Journal of Symbolic Logic;2023-12-11
3. Recursive Polish spaces;Archive for Mathematical Logic;2023-06-09
4. COMPUTABLY COMPACT METRIC SPACES;The Bulletin of Symbolic Logic;2023-05-11
5. Descriptive complexity of qcb0-spaces;Theoretical Computer Science;2023-02