Skip to main content
    • Aa
    • Aa

Some hierarchies of QCB0-spaces


We define and study hierarchies of topological spaces induced by the classical Borel and Luzin hierarchies of sets. Our hierarchies are divided into two classes: hierarchies of countably based spaces induced by their embeddings into , and hierarchies of spaces (not necessarily countably based) induced by their admissible representations. We concentrate on the non-collapse property of the hierarchies and on the relationships between hierarchies in the two classes.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

V. Brattka and P. Hertling (2002) Topological properties of real number representations. Theoretical Computer Science 284 241257.

M. de Brecht (2013) Quasi-Polish spaces. Annals of pure and applied logic 164 356381.

Yu. L. Ershov (1974) Maximal and everywhere defined functionals. Algebra and Logic 13 210225.

M. Escard , J. Lawson and A. Simpson (2004) Comparing Cartesian closed categories of (Core) compactly generated spaces. Topology and its Applications 143 105145.

G. Gierz , K. H. Hoffmann , K. Keimel , J. D. Lawson , M. W. Mislove and D. S. Scott (1980) A compendium of Continuous Lattices, Springer, Berlin.

J. M. L. Hyland (1979) Filter spaces and continuous functionals. Annals of Mathematical Logic 16 101143.

H. Junnila and H.-P. Künzi (1998) Characterizations of absolute Fσδ -sets. Chechoslovak Mathematical Journal 48 5564.

A. Jung (1990) Cartesian closed categories of algebraic CPO's. Theoretical Computer Science 70 233250.

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

C. Kreitz and K. Weihrauch (1985) Theory of representations. Theoretical Computer Science 38 3553.

D. Normann (1980) Recursion on the Countable Functionals. Lecture Notes in Mathematics 811.

M. Schröder (2002) Extended admissibility. Theoretical Computer Science 284 519538.

V. L. Selivanov (2004) Difference hierarchy in ϕ-spaces. Algebra and Logic 43.4 238248.

V. L. Selivanov (2005) Hierarchies in ϕ-spaces and applications. Mathematical Logic Quarterly 51.1 4561.

V. L. Selivanov (2006) Towards a descriptive set theory for domain-like structures. Theoretical Computer Science 365 258282.

V. L. Selivanov (2008) On the difference hierarchy in countably based T 0-spaces. Electronic Notes in Theoretical Computer Science 221 257269.

V. Selivanov (2013) Total representations. Logical Methods in Computer Science 9 (2) 130. doi: 10.2168/LMCS-9(2:5)2013

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 3 *
Loading metrics...

Abstract views

Total abstract views: 103 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 28th March 2017. This data will be updated every 24 hours.