The relation ≪ (is a homomorphic image of) between (linear) order types has properties similar to those of the better known relation ≤ (is embeddable in). For example, the order type η of the rationals not only embeds every countable order type
but also maps homomorphically onto
. If
is scattered, then
can be embedded in (ω* + ω)α for some α < ω1. In that case,
is also a homomorphic image of (ω* + ω)α [Lan 2]. If
is uncountable, then for some uncountable ordinal α, α ≪
, α* ≪
, or η ≪
. Proofs of these facts are much the same for ≤ and ≪.
The main theorem of [Lav 1] implies that the embedding relation better-quasiorders the set of countable order types. Our main theorem (§3) states the analogous result for the homomorphism relation. As a consequence, if
0,
1, … is an infinite sequence of countable order types, then there are i, j, i < j, such that
i, is a homomorphic image of
j. We observed in [Lan 1] that if this is true, then for each countable order type
there is a sentence
of Lω1ω such that if
is a countable order type, then
satisfies
if and only if
is a homomorphic image of
. In fact, the motivation for the work leading to this paper came from this observation.
On the negative side, it is pointed out (§3) that our theorem cannot be extended as far as that of [Lav 1].