A comparison of concepts from computable analysis and effective descriptive set theory
From MaRDI portal
Publication:4593238
DOI10.1017/S0960129516000128zbMath1456.03076arXiv1403.7997OpenAlexW1634634322MaRDI QIDQ4593238
Vassilios Gregoriades, Arno Pauly, Tamás Kispéter
Publication date: 22 November 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.7997
Related Items (12)
Effective aspects of Hausdorff and Fourier dimension ⋮ Towards the Effective Descriptive Set Theory ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Recursive Polish spaces ⋮ ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ Point Degree Spectra of Represented Spaces ⋮ Computability of Subsets of Metric Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- Classical descriptive set theory as a refinement of effective descriptive set theory
- Preservation of the Borel class under countable-compact-covering mappings
- A new proof of a theorem of Jayne and Rogers
- How incomputable is the separable Hahn-Banach theorem?
- First level Borel functions and isomorphisms
- Theory of representations
- Descriptive set theory
- Quasi-Polish spaces
- Some observations on `A new proof of a theorem of Jayne and Rogers'
- Real hypercomputation and continuity
- Products of effective topological spaces and a uniformly computable Tychonoff Theorem
- Sigma^0_alpha - Admissible Representations (Extended Abstract)
- Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
- Effective Choice and Boundedness Principles in Computable Analysis
- Effective Borel measurability and reducibility of functions
- Descriptive Set Theory in the Category of Represented Spaces
- Towards Computability over Effectively Enumerable Topological Spaces
- Total Representations
- Levels of discontinuity, limit-computability, and jump operators
- Decomposing Borel functions using the Shore–Slaman join theorem
- Non-deterministic computation and the Jayne-Rogers Theorem
- On the topological aspects of the theory of represented spaces
- Wadge-like reducibilities on arbitrary quasi-Polish spaces
This page was built for publication: A comparison of concepts from computable analysis and effective descriptive set theory
