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 ℵ₁. 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 .
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-fm183-3-1,
author = {G. Campero-Arena and J. K. Truss},
title = {Countable 1-transitive coloured linear orderings II},
journal = {Fundamenta Mathematicae},
volume = {184},
year = {2004},
pages = {185-213},
zbl = {1061.06002},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm183-3-1}
}
G. Campero-Arena; J. K. Truss. Countable 1-transitive coloured linear orderings II. Fundamenta Mathematicae, Tome 184 (2004) pp. 185-213. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm183-3-1/