Domain theory, Handbook of Logic in Computer Science, vol.3, pp.1-168, 1994. ,
Borel and hausdorff hierarchies in topological spaces of choquet games and their effectivization, Mathematical Structures in Computer Science, vol.25, issue.7, pp.1490-1519, 2015. ,
Quasi-polish spaces, Ann. Pure Appl. Logic, vol.164, issue.3, pp.356-381, 2013. ,
, Overt choice, 2019.
, Notes on quasi-polish spaces, 2018.
Invariant Descriptive Set Theory, 2009. ,
Classes of polish spaces under effective Borel isomorphism. Memoirs of the, vol.240, 1135. ,
A comparison of concepts from computable analysis and effective descriptive set theory, Mathematical Structures in Computer Science, vol.27, issue.8, pp.1414-1436, 2017. ,
Computable metrization, Math. Log. Q, vol.53, issue.4-5, pp.381-395, 2007. ,
Genericity of weakly computable objects, Theory Comput. Syst, vol.60, issue.3, pp.396-420, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01095864
, Classical Descriptive Set Theory, 1995.
Towards computability over effectively enumerable topological spaces, Electr. Notes Theor. Comput. Sci, vol.221, pp.115-125, 2008. ,
On higher effective descriptive set theory, Unveiling Dynamics and Complexity -CiE, vol.10307, pp.282-291, 2017. ,
Recursivity and compactness, Higher Set Theory, vol.669, pp.303-337, 1978. ,
Descriptive Set Theory. Mathematical Surveys and Monographs, 2009. ,
, Theory of Recursive Functions and Effective Computability, 1987.
On index sets in the Kleene-Mostowski hierarchy, Trans. Inst. Math. pp, pp.135-158, 1982. ,
Towards a descriptive set theory for domain-like structures, Theor. Comput. Sci, vol.365, issue.3, pp.258-282, 2006. ,
On the difference hierarchy in countably based t 0 -spaces, Electr. Notes Theor. Comput. Sci, vol.221, pp.257-269, 2008. ,
Towards the effective descriptive set theory, Evolving Computability -CiE, vol.9136, pp.324-333, 2015. ,
Computable Analysis, 2000. ,