Countable 1-transitive coloured linear orderings II
Volume 183 / 2004
Fundamenta Mathematicae 183 (2004), 185-213
MSC: Primary 06A05.
DOI: 10.4064/fm183-3-1
Abstract
This paper gives a structure theorem for the class of countable $1$-transitive coloured linear orderings for a countably infinite colour set, concluding the work begun in [1]. There we gave a complete classification of these orders for finite colour sets, of which there are $\aleph _1$. For infinite colour sets, the details are considerably more complicated, but many features from [1] occur here too, in more marked form, principally the use (now essential it seems) of coding trees, as a means of describing the structures in our list, of which there are now $2^{\aleph _0}$.
