On Higher Effective Descriptive Set Theory
暂无分享,去创建一个
[1] A. Kechris. Classical descriptive set theory , 1987 .
[2] Victor L. Selivanov,et al. Towards a descriptive set theory for domain-like structures , 2006, Theor. Comput. Sci..
[3] Oleg V. Kudinov,et al. Towards Computability of Higher Type Continuous Data , 2005, CiE.
[4] Oleg V. Kudinov,et al. Index Sets as a Measure of Continuous Constraint Complexity , 2014, Ershov Memorial Conference.
[5] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.
[6] Arno Pauly,et al. A comparison of concepts from computable analysis and effective descriptive set theory , 2014, Mathematical Structures in Computer Science.
[7] Matthew de Brecht. Quasi-Polish spaces , 2011, Ann. Pure Appl. Log..
[8] Oleg V. Kudinov,et al. Complexity for partial computable functions over computable Polish spaces , 2016, Mathematical Structures in Computer Science.
[9] Su Gao. Invariant Descriptive Set Theory , 2008 .
[10] Dieter Spreen,et al. On effective topological spaces , 1998, Journal of Symbolic Logic.
[11] Verónica Becher,et al. Normal Numbers and the Borel Hierarchy , 2013, ArXiv.
[12] A. Louveau,et al. Recursivity and compactness , 1978 .
[13] Victor L. Selivanov. Towards the Effective Descriptive Set Theory , 2015, CiE.
[14] Joel David Hamkins,et al. Borel structures: a brief survey , 2013 .
[15] Oleg V. Kudinov,et al. Towards Computability over Effectively Enumerable Topological Spaces , 2008, CCA.
[16] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[17] Robert I. Soare,et al. Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.