SearcharxivSearch

arXiv · 1712.03680

Results in descriptive set theory on some represented spaces

Abstract

Descriptive set theory was originally developed on Polish spaces. It was later extended to $\omega$-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 $\mathcal{O}(\mathbb{N}^\mathbb{N})$, $\mathcal{C}(\mathbb{N}^\mathbb{N},2)$ and the Kleene-Kreisel spaces $\mathbb{N}\langle\alpha\rangle$. We show that there is a $\Sigma^0_2$-subset of $\mathcal{O}(\mathbb{N}^\mathbb{N})$ which is not Borel. We show that the open subsets of $\mathbb{N}^{\mathbb{N}^\mathbb{N}}$ cannot be continuously indexed by elements of $\mathbb{N}^\mathbb{N}$ or even $\mathbb{N}^{\mathbb{N}^\mathbb{N}}$, and more generally that the open subsets of $\mathbb{N}\langle\alpha\rangle$ cannot be continuously indexed by elements of $\mathbb{N}\langle\alpha\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\"oder, 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathieu Hoyrup. 2017-12-11. Results in descriptive set theory on some represented spaces. https://arxiv.org/abs/1712.03680

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO