On Degree Spectra of Topological Spaces

[1]  Arno Pauly,et al.  Overt choice , 2019, Comput..

[2]  Mathieu Hoyrup,et al.  Computability on Quasi-Polish Spaces , 2019, DCFS.

[3]  Julia F. Knight,et al.  UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES , 2018, The Journal of Symbolic Logic.

[4]  Stephen G. Simpson,et al.  Degrees of Unsolvability: A Tutorial , 2015, CiE.

[5]  Victor L. Selivanov.  Towards the Effective Descriptive Set Theory , 2015, CiE.

[6]  Matthew de Brecht.  Quasi-Polish spaces , 2011, Ann. Pure Appl. Log..

[7]  Richard A. Shore,et al.  Computably Enumerable Partial Orders , 2012, Comput..

[8]  Arkadii M. Slinko,et al.  Degree spectra and computable dimensions in algebraic structures , 2002, Ann. Pure Appl. Log..

[9]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[10]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[11]  Viggo Stoltenberg-Hansen,et al.  Mathematical Theory of Domains: Topology , 1994 .

[12]  Viggo Stoltenberg-Hansen,et al.  Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.

[13]  Yuri Leonidovich Ershov,et al.  Theory of Domains and Nearby (Invited Paper) , 1993, Formal Methods in Programming and Their Applications.

[14]  V. Selivanov.  Application of precomplete enumerations to tabular-type degrees and index sets , 1989 .

[15]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[16]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .