Continuous Fraïssé conjecture (Q1013988)

A countable closed linear ordering, denoted cclo, is a countable closed subset of the set of real numbers. A strictly monotone continuous embedding \(h\) from a cclo \(Q_1\) to a cclo \(Q_2\) is an embedding \(h:Q_1\to Q_2\) preserving convergence. If \(Q\) is a quasi-ordered set, a \(Q\)-cclo is a function \(A\) whose domain dom\,\(A\) is a cclo and whose range is \(\subseteq Q\). For two such functions \(A,B\) an embedding relation \(A\preceq B\) is defined by: There exists a strictly monotone continuous embedding \(h\) from dom \(A\) to dom \(B\) with the property \(A(a)\leq_QB(h(a))\) for all \(a\in\text{dom}\,A\). Then it is proved: Let \(Q\) be a better-quasi-ordered set. Then the set of all \(Q\)-cclo's, equipped with \(\preceq\), is well-quasi-ordered. The main result is that the set of countable closed linear orderings is better-quasi-ordered by strictly monotone continuous embeddability, even for the case of labeled countable closed linear orderings. With this, the authors show that there are exactly \(\aleph_1\) many equivalence classes with respect to the embeddability relation. This extends \textit{R. Laver}'s result [Ann. Math. (2) 93, 89--111 (1971; Zbl 0208.28905)]. In Section 3, by using this result, it is proved that there are only \(\aleph_0\) many Gödel logics.