Descriptive complexity on non-Polish spaces - Archive ouverte HAL Access content directly
Conference Papers Year :

Descriptive complexity on non-Polish spaces

(1) , (1)
1

Abstract

Represented spaces are the spaces on which computations can be performed. We investigate the descriptive complexity of sets in represented spaces. We prove that the standard representation of a countably-based space preserves the effective descriptive complexity of sets. We prove that some results from descriptive set theory on Polish spaces extend to arbitrary countably-based spaces. We study the larger class of coPolish spaces, showing that their representation does not always preserve the complexity of sets, and we relate this mismatch with the sequential aspects of the space. We study in particular the space of polynomials.
Fichier principal
Vignette du fichier
final.pdf (488.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02298815 , version 1 (27-09-2019)
hal-02298815 , version 2 (27-09-2019)
hal-02298815 , version 3 (13-01-2020)

Identifiers

Cite

Antonin Callard, Mathieu Hoyrup. Descriptive complexity on non-Polish spaces. STACS 2020 - 37th Symposium on Theoretical Aspects of Computer Science, Mar 2020, Montpellier, France. pp.16, ⟨10.4230/LIPIcs.STACS.2020.8⟩. ⟨hal-02298815v3⟩
294 View
227 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More