A linear ordering is said to be representable if it can be order-embedded into the reals. Representable linear orderings have been characterized as those which are separable in the order topology and have at most countably many jumps. We use this characterization to study the representability of a lexicographic product of linear orderings. First we count the jumps in a lexicographic product in terms of the number of jumps in its factors. Then we relate the separability of a lexicographic product to properties of its factors, and derive a classification of representable lexicographic products.
|Titolo:||Representable Lexicographic Products|
|Data di pubblicazione:||2004|
|Citazione:||Representable Lexicographic Products / GIARLOTTA A. - 21/1(2004), pp. 29-41.|
|Appare nelle tipologie:||1.1 Articolo in rivista|