36 search results - page 1 / 8 » Countably Complementable Linear Orderings |
ORDER
2006
13 years 5 months ago
2006
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
FCT
2007
Springer
13 years 9 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
MLQ
2007
13 years 5 months ago
2007
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
APAL
2006
13 years 5 months ago
2006
The Dushnik
MFCS
2001
Springer
13 years 10 months ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...