Sur La Reconstruction Des Ordres Totaux (Q3030867)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4019115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sur La Reconstruction Des Ordres Totaux |
scientific article; zbMATH DE number 4019115 |
Statements
Sur La Reconstruction Des Ordres Totaux (English)
0 references
1988
0 references
linear orderings
0 references
embeddable
0 references
scattered
0 references
0.7498729228973389
0 references
Let \(X\) and \(Y\) be two linear orderings. \(X\le Y\) means that \(X\) is embeddable in \(Y\). \(X<Y\) means that \(X\le Y\) and \(Y\nleq X\). \(X\equiv Y\) means that \(X\le Y\) and \(Y\leq X)\). Theorem 1 says that if \(A\) and \(B\) are two scattered (without dense subset) linear orderings such that for any \(X\) we have \(X<A\Rightarrow X<B\), then \(A\equiv B\) except if \(A\simeq \omega\) and \(B\simeq \omega^*\) or conversely. Theorem 2 says that if \(A\) and \(B\) are two linear orderings on the same set \(E\) such that for any \(x\in E\) we have \(A| (E-\{x\})\equiv B| (E-\{x\})\) then \(A\equiv B\).
0 references