Uniqueness of linear extensions of partial orders (Q795070)

From MaRDI portal
Revision as of 10:41, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Uniqueness of linear extensions of partial orders
scientific article

    Statements

    Uniqueness of linear extensions of partial orders (English)
    0 references
    1983
    0 references
    \(A\leq B\) means the poset A is isomorphically embeddable into the poset B. A is said to be equivalent to B iff \(A\leq B\leq A\). A chain C is called indecomposable iff \(C\leq X\) or \(C\leq Y\) whenever \(X\cup Y=C\). The author gives a full characterization of a countable poset with finite width all linear extensions of which are equivalent to a finite sum of indecomposable chains. The paper is motivated by \textit{E. Szpilrajn}'s result [Fundam. Math. 16, 386-389 (1930; JFM 56.0843.02)] on the existence of linear extensions of each partial order. For the existence of a linear order on a set, see \textit{A. Mostowski} [ibid. 32, 201-252 (1939; Zbl 0022.12004)].
    0 references
    countable poset with finite width
    0 references
    linear extensions
    0 references
    finite sum of indecomposable chains
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references