Standard

Computability on Quasi-Polish Spaces. / Hoyrup, Mathieu; Rojas, Cristóbal; Selivanov, Victor; Stull, Donald M.

Descriptional Complexity of Formal Systems. 2019. p. 171-183 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11612).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Hoyrup, M, Rojas, C, Selivanov, V & Stull, DM 2019, Computability on Quasi-Polish Spaces. in Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11612, pp. 171-183, 21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019, Košice, Slovakia, 17/07/19. https://doi.org/10.1007/978-3-030-23247-4_13

APA

Hoyrup, M., Rojas, C., Selivanov, V., & Stull, D. M. (2019). Computability on Quasi-Polish Spaces. In Descriptional Complexity of Formal Systems (pp. 171-183). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11612). https://doi.org/10.1007/978-3-030-23247-4_13

Vancouver

Hoyrup M, Rojas C, Selivanov V, Stull DM. Computability on Quasi-Polish Spaces. In Descriptional Complexity of Formal Systems. 2019. p. 171-183. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-23247-4_13

Author

Hoyrup, Mathieu ; Rojas, Cristóbal ; Selivanov, Victor ; Stull, Donald M. / Computability on Quasi-Polish Spaces. Descriptional Complexity of Formal Systems. 2019. pp. 171-183 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{d46889c0446242b5880d691eee2d1f84,
title = "Computability on Quasi-Polish Spaces",
abstract = "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.",
author = "Mathieu Hoyrup and Crist{\'o}bal Rojas and Victor Selivanov and Stull, {Donald M.}",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-23247-4_13",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "171--183",
booktitle = "Descriptional Complexity of Formal Systems",
note = "21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 ; Conference date: 17-07-2019 Through 19-07-2019",

}

RIS

TY - GEN

T1 - Computability on Quasi-Polish Spaces

AU - Hoyrup, Mathieu

AU - Rojas, Cristóbal

AU - Selivanov, Victor

AU - Stull, Donald M.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85069438331&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-23247-4_13

DO - 10.1007/978-3-030-23247-4_13

M3 - Conference contribution

AN - SCOPUS:85069438331

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 171

EP - 183

BT - Descriptional Complexity of Formal Systems

T2 - 21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019

Y2 - 17 July 2019 through 19 July 2019

ER -

ID: 126992202