Countably categorical coloured linear orders



In this paper, we give a classification of (finite or countable) ℵ0-categorical coloured linear orders, generalizing Rosenstein's characterization of ℵ0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and ℚn-combinations (for n ≥ 1). We give a method using coding trees to describe all structures in our list (© 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)