caa a22 4500 445813733 CHVBK 20180317145219.0 cr unu---uuuuu 170323e20111101xx s 000 0 eng 10.1007/s11083-010-9178-9 doi (NATIONALLICENCE)springer-10.1007/s11083-010-9178-9 Classification of Finite Coloured Linear Orderings [Elektronische Daten] [Feresiano Mwesigye, John Truss] 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 which it follows that g is computable. We give exact values for g(m,1) and g(m,2). The method of characters is developed and used. Springer Science+Business Media B.V., 2010 Colours nationallicence Classification nationallicence Coloured linear orderings nationallicence Mwesigye Feresiano Department of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK aut Truss John Department of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK aut Order Springer Netherlands 28/3(2011-11-01), 387-397 0167-8094 28:3<387 2011 28 11083 https://doi.org/10.1007/s11083-010-9178-9 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11083-010-9178-9 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Mwesigye Feresiano Department of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK aut NATIONALLICENCE 700 1- Truss John Department of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK aut NATIONALLICENCE 773 0- Order Springer Netherlands 28/3(2011-11-01), 387-397 0167-8094 28:3<387 2011 28 11083 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer