SearcharxivSearch

arXiv · 2509.14614

The countable condensation on linear orders

Abstract

The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense to $1$ under the countable condensation by constructing a linear order $U$ that is universal for the order types $L$ such that $L/\!\!\sim_\omega\, \cong 1$. We define a multiplication operation $\cdot_\omega$ on the class of linear orders by setting $M \cdot_\omega L$ to be the order type of $(ML)/\!\!\sim_\omega$ (where $ML$ denotes the lexicographic product), and show that the right identities for $\cdot_\omega$ are exactly the uncountable suborders of $U$. The order types of these uncountable suborders of $U$ form a left regular band under $\cdot_\omega$, and the order types of all suborders of $U$ form a semigroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jennifer Brown, Ricardo Suárez. 2025-09-18. The countable condensation on linear orders. https://arxiv.org/abs/2509.14614

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