dc.contributor.author | Campero-Arena, G | |
dc.contributor.author | Truss, JK | |
dc.date.accessioned | 2011-01-22T10:27:15Z | |
dc.date.available | 2011-01-22T10:27:15Z | |
dc.date.issued | 2004 | |
dc.identifier.issn | 0016-2736 | |
dc.identifier.uri | http://hdl.handle.net/11154/1454 | |
dc.description.abstract | 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 N-1. 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(NO). | en_US |
dc.language.iso | en | en_US |
dc.title | Countable 1-transitive coloured linear orderings II | en_US |
dc.type | Article | en_US |
dc.identifier.idprometeo | 1605 | |
dc.source.novolpages | 183(3):185-213 | |
dc.subject.wos | Mathematics | |
dc.description.index | WoS: SCI, SSCI o AHCI | |
dc.relation.journal | Fundamenta Mathematicae |
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |