Skip to main content

Base-Complexity Classifications of QCB\(_0\)-Spaces

  • Conference paper
  • First Online:
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 define and study new classifications of qcb\(_0\)-spaces based on the idea to measure the complexity of their bases. The new classifications complement those given by the hierarchies of qcb\(_0\)-spaces introduced in [7, 8] and provide new tools to investigate non-countably based qcb\(_0\)-spaces. As a by-product, we show that there is no universal qcb\(_0\)-space and establish several apparently new properties of the Kleene-Kreisel continuous functionals of countable types.

M. de Brecht—Supported by JSPS Core-to-Core Program, A. Advanced Research Networks

M. Schröder—Supported by FWF research project “Definability and computability” and by DFG project Zi 1009/4-1.

V. Selivanov—Supported by the DFG Mercator professorship at the University of Würzburg, by the RFBR-FWF project “Definability and computability”, by RFBR project 13-01-00015a, and by 7th EU IRSES project 294962 (COMPUTAL).

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

Access this chapter

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. de Brecht, M.: Quasi-polish spaces. Ann. Pure Applied Logic 164, 356–381 (2013)

    Article  MATH  Google Scholar 

  2. Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1995)

    Book  MATH  Google Scholar 

  3. Kleene, S.C.: Countable functionals. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 87–100. North Holland, Amsterdam (1959)

    Google Scholar 

  4. Kreisel, G.: Interpretation of analysis by means of constructive functionals of finite types. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 101–128. North Holland, Amsterdam (1959)

    Google Scholar 

  5. Schröder, M: Admissible representations for continuous computations. Ph.D. thesis Fachbereich Informatik, FernUniversität Hagen (2003)

    Google Scholar 

  6. Schröder, M.: A Hofmann-Mislove Theorem for Scott Open Sets (2015). arXiv:1501.06452

  7. Schröder, M., Selivanov, V.: Some hierarchies of qcb\(_0\)-spaces. Math. Struct. in Comp. Sci. (2014). doi:10.1017/S0960129513000376

  8. Schröder, M., Selivanov, V.: Hyperprojective hierarchy of qcb\(_{0}\)-spaces. Computability 4(1), 1–17 (2015)

    Google Scholar 

  9. Selivanov, V.: Total representations. Logical Methods Comput. Sci. 9(2), 1–30 (2013)

    Article  MathSciNet  Google Scholar 

  10. Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthew de Brecht .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

de Brecht, M., Schröder, M., Selivanov, V. (2015). Base-Complexity Classifications of QCB\(_0\)-Spaces. 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_16

Download citation

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

  • 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