Czasopismo
Tytuł artykułu
Autorzy
Warianty tytułu
Języki publikacji
Abstrakty
This paper gives a structure theorem for the class of countable 1-transitive coloured linear orderings for a countably infinite colour set, concluding the work begun in [1]. There we gave a complete classification of these orders for finite colour sets, of which there are ℵ₁. For infinite colour sets, the details are considerably more complicated, but many features from [1] occur here too, in more marked form, principally the use (now essential it seems) of coding trees, as a means of describing the structures in our list, of which there are now $2^{ℵ₀}$.
Słowa kluczowe
Czasopismo
Rocznik
Tom
Numer
Strony
185-213
Opis fizyczny
Daty
wydano
2004
Twórcy
autor
- Departamento de Matemáticas, Facultad de Ciencias, Universidad Nacional Autónoma de México, Ciudad Universitaria, México, D.F. 04510, Mexico
autor
- Department of Pure Mathematics, University of Leeds, Leeds LS2 9JT, England
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-doi-10_4064-fm183-3-1