# On countably saturated linear orders and certain class of countably saturated graphs

## TL;DR

This paper investigates the existence, uniqueness, and structure of countably saturated models across linear orders, graphs, and Boolean algebras, revealing new examples, proofs, and set-theoretic dependencies.

## Contribution

It provides new examples of non-isomorphic countably saturated linear orders, a new proof of the basis theorem, and establishes the existence and uniqueness of an uncountable random graph and a prime Boolean algebra.

## Key findings

- Existence of non-isomorphic countably saturated linear orders under different set-theoretic assumptions
- A new proof of the basis theorem for countably saturated linear orders
- Existence and uniqueness of an uncountable random graph and a prime Boolean algebra

## Abstract

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality $\mathfrak{c}$. We provide some examples of pairwise non-isomorphic countably saturated linear orders of cardinality $\mathfrak{c}$, under different set-theoretic assumptions. We give a new proof of the old theorem of Harzheim, that the class of countably saturated linear orders has a uniquely determined one-element basis. From our proof it follows that this minimal linear order is a Fra\"isse limit of certain Fra\"isse class. In particular, it is homogeneous with respect to countable subsets. Next, we prove the existence and uniqueness of the uncountable version of the random graph. This graph is isomorphic to $(H(\omega_1),\in \cup \ni)$, where $H(\omega_1)$ is the set of hereditarily countable sets, and two sets are connected if one of them is an element of the other. In the last section, an example of a prime countably saturated Boolean algebra is presented.