A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract)

We introduce the notion of quasi-zero-dimensionality as a substitute for the notion of zero-dimensionality, motivated by the fact that the latter behaves badly in the realm of qcb-spaces. We prove that the category $QZ$ of quasi-zero-dimensional qcb$_0$-spaces is cartesian closed. Prominent examples of spaces in $QZ$ are the spaces in the sequential hierarchy of the Kleene-Kreisel continuous functionals. Moreover, we characterise some types of closed subsets of $QZ$-spaces in terms of their ability to allow extendability of continuous functions. These results are related to an open problem in Computable Analysis

Descriptive Complexity on Non-Polish Spaces II

This article is a study of descriptive complexity of subsets of represented spaces. Two competing measures of descriptive complexity are available. The first one is topological and measures how complex it is to obtain a set from open sets using boolean operations. The second one measures how complex it is to test membership in the set, and we call it symbolic complexity because it measures the complexity of the symbolic representation of the set. While topological and symbolic complexity are equivalent on countably-based spaces, they differ on more general spaces. Our investigation is aimed at explaining this difference and highly suggests that it is related to the well-known mismatch between topological and sequential aspects of topological spaces

Results in descriptive set theory on some represented spaces

Descriptive set theory was originally developed on Polish spaces. It was later extended to ω-continuous domains [Selivanov 2004] and recently to quasi-Polish spaces [de Brecht 2013]. All these spaces are countably-based. Extending descriptive set theory and its effective counterpart to general represented spaces, including non-countably-based spaces has been started in [Pauly, de Brecht 2015].We study the spaces $O(N^N)$, $C(N^N, 2)$ and the Kleene-Kreisel spaces $N\langle α\rangle$. We show that there is a $Σ^0_2$-subset of $O(N^N)$ which is not Borel. We show that the open subsets of $N^{N^N}$ cannot be continuously indexed by elements of $N^N$ or even $N^{N^N}$, and more generally that the open subsets of $N\langle α\rangle$ cannot be continuously indexed by elements of $N\langle α\rangle$. We also derive effective versions of these results.These results give answers to recent open questions on the classification of spaces in terms of their base-complexity, introduced in [de Brecht, Schröder, Selivanov 2016]. In order to obtain these results, we develop general techniques which are refinements of Cantor's diagonal argument involving multi-valued fixed-point free functions and that are interesting on their own right

Unveiling Dynamics and Complexity

We introduce generalized Wadge games and show that each lower cone in the Weihrauch degrees is characterized by such a game. These generalized Wadge games subsume (a variant of) the original Wadge game, the eraser and backtrack games as well as Semmes’s tree games. In particular, we propose that the lower cones in the Weihrauch degrees are the answer to Andretta’s question on which classes of functions admit game characterizations. We then discuss some applications of such generalized Wadge games.SCOPUS: cp.kinfo:eu-repo/semantics/publishe

Total Representations

Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and representations closer, unify some terminology, simplify some technical details, suggest interesting open questions and new invariants of topological spaces relevant to computable analysis.Comment: 30 page