Countably categorical coloured linear orders

Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical 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 Qn-combinations (for n ≥ 1). We give a method using coding trees to describe all structures in our list.

• Type: Journal
• Year: 2010
• Where: MLQ
• Authors: Feresiano Mwesigye, John K. Truss
• Keywords: MLQ 2010, Rosenstein’s Characterization, ℵ0-categorical Linear Orderings, ℵ0categorical Coloured Linear