Descriptive complexity on non-Polish spaces

DOI10.4230/LIPICS.STACS.2020.8MaRDI QIDQ5874279zbMATH OpenOpenAlexFDO

Authors Antonin Callard, Mathieu Hoyrup

Publication date 7 February 2023

Full work available at URL https://hal.inria.fr/hal-02298815

zbMATH Keywords

computable analysiscopolish spacesdescriptive set theoryrepresented space

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(7)

• The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space
• Effective wadge hierarchy in computable quasi-Polish spaces
• Effective aspects of Hausdorff and Fourier dimension
• A syntactic approach to Borel functions: some extensions of Louveau's theorem
• Notes on overt choice
• Descriptive complexity on non-Polish spaces. II
• Represented spaces of represented spaces

This page was built for publication: Descriptive complexity on non-Polish spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874279)