Computability on Quasi-Polish Spaces

Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, Donald M. Stull

Resultado de la investigación: Conference contribution

Resumen

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.

Idioma originalEnglish
Título de la publicación alojadaDescriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings
EditoresMichal Hospodár, Galina Jirásková, Stavros Konstantinidis
EditorialSpringer Verlag
Páginas171-183
Número de páginas13
ISBN (versión impresa)9783030232467
DOI
EstadoPublished - 1 ene 2019
Evento21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 - Košice, Slovakia
Duración: 17 jul 201919 jul 2019

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen11612 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conference

Conference21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019
PaísSlovakia
CiudadKošice
Período17/07/1919/07/19

Huella dactilar

Polish Space
Computability
Quasi-metric Space
Baire Space
Strictly

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Citar esto

Hoyrup, M., Rojas, C., Selivanov, V., & Stull, D. M. (2019). Computability on Quasi-Polish Spaces. En M. Hospodár, G. Jirásková, & S. Konstantinidis (Eds.), Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings (pp. 171-183). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11612 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-23247-4_13
Hoyrup, Mathieu ; Rojas, Cristóbal ; Selivanov, Victor ; Stull, Donald M. / Computability on Quasi-Polish Spaces. Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. editor / Michal Hospodár ; Galina Jirásková ; Stavros Konstantinidis. Springer Verlag, 2019. pp. 171-183 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{20afcf2f4d7f4fdb822d87b356123c5b,
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 = "1",
day = "1",
doi = "10.1007/978-3-030-23247-4_13",
language = "English",
isbn = "9783030232467",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "171--183",
editor = "Michal Hospod{\'a}r and Galina Jir{\'a}skov{\'a} and Stavros Konstantinidis",
booktitle = "Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings",
address = "Germany",

}

Hoyrup, M, Rojas, C, Selivanov, V & Stull, DM 2019, Computability on Quasi-Polish Spaces. En M Hospodár, G Jirásková & S Konstantinidis (eds.), Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11612 LNCS, Springer Verlag, 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

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

Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. ed. / Michal Hospodár; Galina Jirásková; Stavros Konstantinidis. Springer Verlag, 2019. p. 171-183 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11612 LNCS).

Resultado de la investigación: Conference contribution

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

SN - 9783030232467

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 - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings

A2 - Hospodár, Michal

A2 - Jirásková, Galina

A2 - Konstantinidis, Stavros

PB - Springer Verlag

ER -

Hoyrup M, Rojas C, Selivanov V, Stull DM. Computability on Quasi-Polish Spaces. En Hospodár M, Jirásková G, Konstantinidis S, editores, Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. Springer Verlag. 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