Changing the Depth of an Ordered Set by Decomposition

DOI10.2307/2000314zbMATH Open0615.04007OpenAlexW4231682887MaRDI QIDQ4723740FDOQ4723740

Authors: Karel Prikry, Eric C. Milner 

Publication date: 1985

Full work available at URL: https://doi.org/10.2307/2000314

Recommendations

• scientific article; zbMATH DE number 3877242
• Decomposition of partial orders
• Publication:3495389
• On the width of ordered sets and Boolean algebras
• Dimension may exceed width

zbMATH Keywords

widthpartition relationsuccessor cardinaldepth of a partially ordered setextendable ordinal

Mathematics Subject Classification ID

Partial orders, general (06A06) Other combinatorial set theory (03E05)

Cites Work

• Title not available (Why is that?)
• Partially Ordered Sets
• A decomposition theorem for partially ordered sets
• Combinatorial set theory: Partition relations for cardinals
• A proof (involving Martin's axiom) of a partition relation
• Partition relations for partially ordered sets
• On Dilworth's theorem in the infinite case
• Title not available (Why is that?)
• The Cofinality of a Partially Ordered Set
• The Pigeon-Hole Principle for Ordinal Numbers
• On decomposition of graphs

Cited In (5)

• On the width of ordered sets and Boolean algebras
• The deviation, density, and depth of partially ordered sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the decomposition of order-separable posets of countable width into chains

This page was built for publication: Changing the Depth of an Ordered Set by Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723740)