A proof of Dilworth's decomposition theorem for partially ordered sets (Q2625477): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Micha A. Perles / rank
Normal rank
 
Property / author
 
Property / author: Micha A. Perles / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236249 / 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: Note on Dilworth's Decomposition Theorem for Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice functions and Tychonoff’s theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Marriage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic Treatment of Rank in Infinite Sets / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02759805 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970064177 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
A proof of Dilworth's decomposition theorem for partially ordered sets
scientific article

    Statements

    A proof of Dilworth's decomposition theorem for partially ordered sets (English)
    0 references
    1963
    0 references
    ordered sets, lattices
    0 references
    0 references

    Identifiers