#### Filter Results:

#### Publication Year

2010

2011

#### Co-author

#### Key Phrase

#### Publication Venue

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)

This paper concerns the classification of finite coloured linear orders up to n-equivalence. Ehrenfeucht-Fra¨ıssé games are used to define what this means, and also to help analyze such structures. We give an explicit bound for the least number g(m, n) such that any finite m-coloured linear order is n-equivalent to some ordering of size ≤ g(m, n), from… (More)

- ‹
- 1
- ›