Changing the Depth of an Ordered Set by Decomposition

DOI10.2307/2000314MaRDI QIDQ4723740zbMATH OpenOpenAlexFDO

Authors Karel Prikry, Eric C. Milner

Publication date 1985

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

zbMATH Keywords

widthpartition relationsuccessor cardinaldepth of a partially ordered setextendable ordinal

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• scientific article; zbMATH DE number 3786843 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• A proof (involving Martin's axiom) of a partition relation
• Combinatorial set theory: Partition relations for cardinals
• On Dilworth's theorem in the infinite case
• On decomposition of graphs
• Partially Ordered Sets
• Partition relations for partially ordered sets
• The Cofinality of a Partially Ordered Set
• The Pigeon-Hole Principle for Ordinal Numbers

Cited in

(5)

• scientific article; zbMATH DE number 3877242 (Why is no real title available?)
• The deviation, density, and depth of partially ordered sets
• scientific article; zbMATH DE number 4168727 (Why is no real title available?)
• On the decomposition of order-separable posets of countable width into chains
• On the width of ordered sets and Boolean algebras

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)