Borel Complexity of Topological Operations on Computable Metric Spaces
We study the Borel complexity of topological operations on closed subsets of computable metric spaces. The investigated operations include set theoretic operations as union and intersection, but also typical topological operations such as the closure of the complement, the closure of the interior, the boundary and the derivative of a set. These operations are studied with respect to different computability structures on the hyperspace of closed subsets. These structures include positive or negative information on the represented closed subsets. Topologically, they correspond to the lower or upper Fell topology, respectively, and the induced computability concepts generalize the classical notions of r.e. or co-r.e. subsets, respectively. The operations are classified with respect to effective measurability in the Borel hierarchy and it turns out that most operations can be located in the first three levels of the hierarchy, or they are not even Borel measurable at all. In some cases the effective Borel measurability depends on further properties of the underlying metric spaces, such as effective local compactness and effective local connectedness.
KeywordsComputable analysis effective descriptive set theory Borel measurability hyperspace topologies
Unable to display preview. Download preview PDF.
- 3.Kechris, A.S.: Classical Descriptive Set Theory. Volume 156 of Graduate Texts in Mathematics. Springer, Heidelberg (1995)Google Scholar
- 4.Moschovakis, Y.N.: Descriptive Set Theory. Volume 100 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1980)Google Scholar
- 6.Kuratowski, K.: Topology, vol. 1. Academic Press, London (1966)Google Scholar
- 7.Kuratowski, K.: Topology, vol. 2. Academic Press, London (1968)Google Scholar
- 13.Weihrauch, K.: Computability. Volume 9 of EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1987)Google Scholar
- 21.Brattka, V.: Plottable real number functions. In: Daumas, M., et al. (eds.) RNC’5 Real Numbers and Computers, INRIA, Institut National de Recherche en Informatique et en Automatique 13–30 Lyon, September 3–5, 2003 (2003)Google Scholar