Changing the Depth of an Ordered Set by Decomposition (Q4723740): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A proof (involving Martin's axiom) of a partition relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial set theory: Partition relations for cardinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cofinality of a Partially Ordered Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pigeon-Hole Principle for Ordinal Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dilworth's theorem in the infinite case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition relations for partially ordered sets / rank
 
Normal rank

Latest revision as of 19:09, 17 June 2024

scientific article; zbMATH DE number 3995681
Language Label Description Also known as
English
Changing the Depth of an Ordered Set by Decomposition
scientific article; zbMATH DE number 3995681

    Statements

    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    extendable ordinal
    0 references
    partition relation
    0 references
    depth of a partially ordered set
    0 references
    width
    0 references
    successor cardinal
    0 references
    0 references
    Changing the Depth of an Ordered Set by Decomposition (English)
    0 references