SearcharxivSearch

arXiv · 2409.06516

Borel Order Dimension

Abstract

We introduce and study a notion of Borel order dimension for Borel quasi orders. It will be shown that this notion is closely related to the notion of Borel dichromatic number for simple directed graphs. We prove a dichotomy, which generalizes the ${\GGG}_{0}$-dichotomy, for the Borel dichromatic number of Borel simple directed graphs. By applying this dichotomy to Borel quasi orders, another dichotomy that characterizes the Borel quasi orders of uncountable Borel dimension is proved. We obtain further structural information about the Borel quasi orders of countable Borel dimension by showing that they are all Borel linearizable. We then investigate the locally countable Borel quasi orders in more detail, paying special attention to the Turing degrees, and produce models of set theory where the continuum is arbitrarily large and all locally countable Borel quasi orders are of Borel dimension less than the continuum. Combining our results here with earlier work shows that the Borel order dimension of the Turing degrees is usually strictly larger than its classical order dimension.

Explore related subjects

Keep this discovery

BibTeXRIS

Dilip Raghavan, Ming Xiao. 2024-09-10. Borel Order Dimension. https://arxiv.org/abs/2409.06516

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