The countable condensation on linear orders
Logic
2025-09-19 v1
Abstract
The countable condensation on a linear order is the equivalence relation defined by declaring when the set of points between and is countable. We characterize the linear orders that condense to under the countable condensation by constructing a linear order that is universal for the order types such that . We define a multiplication operation on the class of linear orders by setting to be the order type of (where denotes the lexicographic product), and show that the right identities for are exactly the uncountable suborders of . The order types of these uncountable suborders of form a left regular band under , and the order types of all suborders of form a semigroup.
Cite
@article{arxiv.2509.14614,
title = {The countable condensation on linear orders},
author = {Jennifer Brown and Ricardo Suárez},
journal= {arXiv preprint arXiv:2509.14614},
year = {2025}
}