On the decomposition of order-separable posets of countable width into chains (Q1568672): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
 
(2 intermediate revisions by one other user not shown)
Property / author
 
Property / author: Joe D. Mashburn / rank
Normal rank
 
Property / author
 
Property / author: Joe D. Mashburn / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 04:56, 5 March 2024

scientific article
Language Label Description Also known as
English
On the decomposition of order-separable posets of countable width into chains
scientific article

    Statements

    On the decomposition of order-separable posets of countable width into chains (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2001
    0 references
    A poset \(X\) is order-separable if it contains a countable dense subset; \(X\) has countable width if it contains no uncountable antichain. The following question is posed: Can every poset with these two properties be written as the union of a countable number of chains? The authors show that the answer is ``no'' if there is a 2-entangled subset of \(\mathbb{R}\), i.e. an uncountable subset \(A\subset \mathbb{R}\) such that there is no uncountable monotone function from some subset of \(A\) into \(A\) with no fixed points, and it is ``yes'' under the Open Coloring Axiom.
    0 references
    0 references
    0 references
    0 references
    0 references
    order-separable poset
    0 references
    width
    0 references
    2-entangled set
    0 references
    open coloring axiom
    0 references