Countably categorical coloured linear orders

Abstract

In this paper, we give a classification of (finite or countable) ℵ0-categorical colored linear orders, generalizing Rosenstein’s characterization of ℵ0-categorical linear orderings. We show that they can all be built from colored singletons by concatenation and Qn-combinations (for n ≥ 1). We give a method using coding trees to describe all structures in our list.