%0 Conference Proceedings
%T Computability on quasi-Polish spaces
%+ Designing the Future of Computational Models (MOCQUA)
%+ Universidad Andrés Bello [Santiago] (UNAB)
%+ Kazan Federal University (KFU)
%A Hoyrup, Mathieu
%A Rojas, Cristóbal
%A Selivanov, Victor
%A Stull, Donald, M
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B DCFS 2019 - 21st International Conference on Descriptional Complexity of Formal Systems
%C Kosice, Slovakia
%Y Michal Hospodár
%Y Galina Jirásková
%Y Stavros Konstantinidis
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-11612
%P 171-183
%8 2019-07-17
%D 2019
%Z Mathematics [math]/General Topology [math.GN]
%Z Mathematics [math]/Logic [math.LO]Conference papers
%X We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open image of the Baire space is a robust notion that admits several characterizations. We show that some natural effectivizations of quasi-metric spaces are strictly stronger.
%G English
%Z TC 1
%Z WG 1.02
%2 https://inria.hal.science/hal-02118947v2/document
%2 https://inria.hal.science/hal-02118947v2/file/revision.pdf
%L hal-02118947
%U https://inria.hal.science/hal-02118947
%~ CNRS
%~ INRIA
%~ INRIA_TEST
%~ INRIA-LORRAINE
%~ LORIA2
%~ INRIA-NANCY-GRAND-EST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ INRIA-CHILE
%~ IFIP
%~ UNIV-LORRAINE
%~ INRIA2
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ LORIA
%~ LORIA-FM
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-11612
%~ TEST-HALCNRS