SearcharxivSearch

arXiv · 1709.04234

Borel subsets of the real line and continuous reducibility

Abstract

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with respect to continuous functions on $\mathbb{R}$. Notably, we explore several structural properties of Borel subsets of $\mathbb{R}$ that diverge from those of Polish spaces with dimension zero. Our first main result is on the existence of embeddings of several posets into the restriction of this quasi-order to any Borel class that is strictly above the classes of open and closed sets, for instance the linear order $\omega_1$, its reverse $\omega_1^\star$ and the poset $\mathcal{P}(\omega)/\mathsf{fin}$ of inclusion modulo finite error. As a consequence of its proof, it is shown that there are no complete sets for these classes. We further extend the previous theorem to targets that are reducible to $\mathbb{Q}$. These non-structure results motivate the study of further restrictions of the Wadge quasi-order. In our second main theorem, we introduce a combinatorial property that is shown to characterize those $F_\sigma$ sets that are reducible to $\mathbb{Q}$. This is applied to construct a minimal set below $\mathbb{Q}$ and prove its uniqueness up to Wadge equivalence. We finally prove several results concerning gaps and cardinal characteristics of the Wadge quasi-order and thereby answer questions of Brendle and Geschke.

Explore related subjects

Keep this discovery

BibTeXRIS

Daisuke Ikegami, Philipp Schlicht, Hisao Tanaka. 2017-09-13. Borel subsets of the real line and continuous reducibility. https://arxiv.org/abs/1709.04234

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