Changing the Depth of an Ordered Set by Decomposition

DOI10.2307/2000314zbMath0615.04007OpenAlexW4231682887MaRDI QIDQ4723740

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)

Related Items (2)

On the width of ordered sets and Boolean algebras ⋮ The deviation, density, and depth of partially ordered sets

Cites Work

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

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