Skip to main content
SpringerLink
Log in

Towards the Effective Descriptive Set Theory

  • Conference paper
  • First Online:
Book cover Evolving Computability (CiE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9136))

Included in the following conference series:

Abstract

We prove effective versions of some classical results about measurable functions and derive from this extensions of the Suslin-Kleene theorem, and of the effective Hausdorff theorem for the computable Polish spaces (this was established in [2] with a different proof) and for the computable \(\omega \)-continuous domains (this answers an open question from [2]).

V. Selivanov—Supported by a Marie Curie International Research Staff Exchange Scheme Fellowship within the 7th European Community Framework Programme, by DFG Mercator Programme at the University of Würzburg, and by RFBR project 13-01-00015a.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, pp. 1–168. Clarendon Press, Oxford (1994)

    Google Scholar 

  2. Becher, V., Grigorieff, S.: Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. Math. Struct. Comput. Sci. Available on CJO (2014). doi:10.1017/S096012951300025X

  3. Brattka, V.: Effective Borel measurability and reducibility of functions. Math. Logic Q. 51(1), 19–44 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. de Brecht, M.: Quasi-Polish spaces. Ann. Pure Appl. Logic 164, 356–381 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ershov, Y.L.: On a hierarchy of sets 1,2,3 (in Russian). Algebra i Logika 7(4), 15–47 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gregoriades, V., Kispeter, T., Pauly, A.: A comparison of concepts from computable analysis and effective descriptive set theory. Mathematical structures in computer science (submitted to). arxiv.org/pdf/1403.7997

    Google Scholar 

  7. Gregoriades V.: Effective refinements of classical theorems in descriptive set theory (informal presentation). Talks at Conference “Computability and Complexity in Analysis” in Nancy (2013). http://cca-net.de/cca2013/slides/

  8. Gregoriades, V.: Classes of polish spaces under effective Borel isomorphism. Mem. Amer. Math. Soc. (to appear). www.mathematik.tu-darmastadt.de/gregoriages/papers/eff.webpage.pdf

  9. Grubba, T., Schröder, M., Weihrauch, K.: Computable metrization. Math. Logic Q. 53, 381–395 (2007)

    Article  MATH  Google Scholar 

  10. Hemmerling, A.: The Hausdorff-Ershov hierarchy in Euclidean spaces. Arch. Math. Logic 45, 323–350 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kechris, A.S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics, vol. 156. Springer, New York (1995)

    MATH  Google Scholar 

  12. Korovina, M.V., Kudinov, O.V.: Basic principles of \(\varSigma \)-definability and abstract computability. Schriften zur Theoretischen Informatik, Bericht Nr 08–01, Univeversität Siegen (2008)

    Google Scholar 

  13. Louveau, A.: Recursivity and compactness. In: Müller, G.H., Scott, D.S. (eds.) Higher Set Theory. Lecture Notes in Mathematics, vol. 669, pp. 303–337. Springer, Heidelberg (1978)

    Chapter  Google Scholar 

  14. Louveau, A.: A separation theorem for \(\varSigma ^1_1\)-sets. Trans. Amer. Math. Soc. 260(2), 363–378 (1980)

    MathSciNet  Google Scholar 

  15. Moschovakis, Y.N.: Descriptive Set Theory. North Holland, Amsterdam (2009)

    Book  MATH  Google Scholar 

  16. Motto Ros, L., Schlicht, P., Selivanov, V.: Wadge-like reducibilities on arbitrary quasi-Polish spaces. Mathematical structures in computer science (to appear). arXiv:1304.1239 [cs.LO]

  17. Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)

    MATH  Google Scholar 

  18. Selivanov, V.L.: Wadge degrees of \(\omega \)-languages of deterministic Turing machines. Theor. Inf. Appl. 37, 67–83 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Selivanov, V.L.: Variations on the Wadge reducibility. Siberian Adv. Math. 15, 44–80 (2005)

    MathSciNet  Google Scholar 

  20. Selivanov, V.L.: Towards a descriptive set theory for domain-like structures. Theor. Comput. Sci. 365(3), 258–282 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  21. Selivanov, V.L.: On the difference hierarchy in countably based \(T_0\)-spaces. Electron. Notes Theor. Comput. Sci. 221, 257–269 (2008)

    Article  MathSciNet  Google Scholar 

  22. Gao, S.: Invariant Descriptive Set Theory. CRC Press, New York (2009)

    MATH  Google Scholar 

  23. Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)

    Book  MATH  Google Scholar 

Download references

Acknowledgement

I thank the anonymous referees for useful comments and bibliographical hints.

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems SB RAS, Novosibirsk, Russia

    Victor Selivanov

Authors
  1. Victor Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor Selivanov .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  2. University of Bucharest, Bucharest, Romania

    Victor Mitrana

  3. Sofia University, Sofia, Bulgaria

    Mariya Soskova

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Selivanov, V. (2015). Towards the Effective Descriptive Set Theory. 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_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20028-6_33

  • 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)

Publish with us

Policies and ethics

Search

Navigation