Skip Navigation


Journal of Logic and Computation Advance Access originally published online on August 6, 2008
Journal of Logic and Computation 2009 19(1):45-76; doi:10.1093/logcom/exn027
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Brattka, V.
Right arrow Articles by Gherardi, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

This article appears in the following Journal of Logic and Computation issue: Special Issue: Logic and Computation in the Real World: CiE 2007 [View the issue table of contents]

Original Articles

Borel Complexity of Topological Operations on Computable Metric Spaces

Vasco Brattka *

Laboratory of Foundational Aspects of Computer Science, Department of Mathematics and Applied Mathematics, University of Cape Town, South Africa.
E-mail: vasco.brattka{at}uct.ac.za

Guido Gherardi

Dipartimento di Filosofia, University of Bologna, Italy.
E-mail: guido.gherardi{at}unibo.it

Received 22 February 2008.

We study the Borel complexity of topological operations on closed subsets of computable metric spaces. The investigated operations include set theoretic operations such 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 recursively enumerable (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.

Keywords: Computable analysis; effective descriptive set theory; effective Borel complexity; theory of representations; Fell topology; Effros Borel structure

*This work has been partially supported by the National Research Foundation (NRF).



References

  1. Brattka V. Computable invariance. Theoretical Computer Science (1999) 210:3–20.[CrossRef][Web of Science]
  2. Brattka V. Random numbers and an incomplete immune recursive set. In: Automata, Languages and Programming.—Widmayer P, Triguero F, Morales R, Hennessy M, Eidenbenz S, Conejo R, eds. (2002) 2380. Berlin: Springer. 950–961. Lecture Notes in Computer Science, 29th International Colloquium, ICALP, Málaga, Spain, July 8–13, 2002.[CrossRef][Web of Science]
  3. Brattka V. Plottable real number functions and the computable graph theorem. SIAM Journal on Computing (2008) 38:303–328.[CrossRef][Web of Science]
  4. Brattka V. Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly (2005) 51:19–44.[Medline]
  5. Brattka V, Presser G. Computability on subsets of metric spaces. Theoretical Computer Science (2003) 305:43–76.[CrossRef][Web of Science]
  6. Brattka V, Weihrauch K. Computability on subsets of Euclidean space I: closed and compact subsets. Theoretical Computer Science (1999) 219:65–93.[CrossRef][Web of Science]
  7. Cenzer D, Mauldin RD. On the Borel class of the derived set operator. Bulletin de la Sociéte Mathématique de France (1982) 110:357–380.[Web of Science]
  8. Cenzer D, Mauldin RD. On the Borel class of the derived set operator: II. Bulletin de la Sociéte Mathématique de France (1983) 111:367–372.
  9. Christensen JPR. On some properties of Effros Borel structure on spaces of closed subsets. Mathematische Annalen (1971) 195:17–23.[CrossRef][Web of Science]
  10. Christensen JPR. Necessary and sufficient conditions for the measurability of certain sets of closed subsets. Mathematische Annalen (1973) 200:189–193.[CrossRef][Web of Science]
  11. Christensen JPR. Topology and Borel Structure. (1974) Amsterdam: North-Holland.
  12. Effros EG. Convergence of closed subsets in a topological space. Proceedings of the American Mathematical Society (1965) 16:929–931.[CrossRef][Web of Science]
  13. Engelking R. (1989) Berlin: Heldermann. General Topology volume 6 of Sigma Series in Pure Mathematics.
  14. Gherardi G. Effective Borel degrees of some topological functions. Mathematical Logic Quarterly (2006) 52:625–642.[CrossRef][Web of Science]
  15. Holá L, Pelant J, Zsilinszky L. Developable hyperspaces are metrizable. Applied General Topology (2003) 4:351–360.
  16. Kechris AS. (1995) Berlin: Springer. Classical Descriptive Set Theory volume 156 of Graduate Texts in Mathematics.
  17. Kreitz C, Weihrauch K. Theory of representations. Theoretical Computer Science (1985) 38:35–53.[CrossRef][Web of Science]
  18. Kuratowski K. Topology, Volume 1. (1966) New York: Academic Press.
  19. Kuratowski K. Topology, Volume 2. (1968) New York: Academic Press.
  20. Moschovakis YN. (1980) Amsterdam: North-Holland. Descriptive Set Theory, volume 100 of Studies in Logic and the Foundations of Mathematics.
  21. Raymond JS. La structure borélienne d’Effros est-elle standard? Fundamenta Mathematicae (1978) 100:201–210.
  22. Schröder M. Extended admissibility. Theoretical Computer Science (2002) 284:519–538.[CrossRef][Web of Science]
  23. Schröder M. Admissible Representations for Continuous Computations. Informatik Berichte 299, FernUniversität Hagen, Hagen, April 2003. Dissertation.
  24. Weihrauch K. (1987) Berlin: Springer. Computability, volume 9 of EATCS Monographs on Theoretical Computer Science.
  25. Weihrauch K. Computable Analysis. (2000) Berlin: Springer.
  26. Weihrauch K. On computable metric spaces Tietze-Urysohn extension is computable. Blanck Jens, Brattka Vasco, Hertling Peter, eds. (2001) Berlin. 357–368. Computability and Complexity in Analysis, Volume 2064 of Lecture Notes in Computer Science 4th InternationalWorkshop, CCA 2000, Swansea, UK, September 2000.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Brattka, V.
Right arrow Articles by Gherardi, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?