Computability on Quasi-Polish Spaces › SPbU Researchers Portal

DOI

https://doi.org/10.1007/978-3-030-23247-4_13
Final published version

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

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.

Original language	English
Title of host publication	Descriptional Complexity of Formal Systems
Pages	171-183
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-030-23247-4_13
State	Published - 1 Jan 2019
Event	21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 - Košice, Slovakia Duration: 17 Jul 2019 → 19 Jul 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Nature
Volume	11612
ISSN (Print)	0302-9743

Conference

Conference	21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019
Country/Territory	Slovakia
City	Košice
Period	17/07/19 → 19/07/19

ID: 126992202