Computability on quasi-Polish spaces - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2019

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.
Fichier principal
Vignette du fichier
revision.pdf (307.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02118947 , version 1 (03-05-2019)
hal-02118947 , version 2 (07-05-2019)

Identifiers

  • HAL Id : hal-02118947 , version 2

Cite

Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, Donald M Stull. Computability on quasi-Polish spaces. DCFS 2019 - 21st International Conference on Descriptional Complexity of Formal Systems, Jul 2019, Kosice, Slovakia. pp.171-183. ⟨hal-02118947v2⟩
80 View
166 Download

Share

Gmail Facebook X LinkedIn More