Feresiano Mwesigye

Learn More
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 Qn-combinations (for n ≥ 1). We give a method using coding trees to describe all structures(More)
  • 1