Countable 1-transitive coloured linear orderings II

G. Campero-Arena, and J. K. Truss. "Countable 1-transitive coloured linear orderings II." Fundamenta Mathematicae 183.3 (2004): 185-213. <http://eudml.org/doc/282625>.

@article{G2004,
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 ℵ₁. 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^\{ℵ₀\}$.},
author = {G. Campero-Arena, J. K. Truss},
journal = {Fundamenta Mathematicae},
keywords = {structure theorem; coloured linear orderings; countably infinite colour set},
language = {eng},
number = {3},
pages = {185-213},
title = {Countable 1-transitive coloured linear orderings II},
url = {http://eudml.org/doc/282625},
volume = {183},
year = {2004},
}

TY - JOUR
AU - G. Campero-Arena
AU - J. K. Truss
TI - Countable 1-transitive coloured linear orderings II
JO - Fundamenta Mathematicae
PY - 2004
VL - 183
IS - 3
SP - 185
EP - 213
AB - 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 $2^{ℵ₀}$.
LA - eng
KW - structure theorem; coloured linear orderings; countably infinite colour set
UR - http://eudml.org/doc/282625
ER -