Abstract
In their paper from 1981, Milner and Sauer conjectured that for any poset 〈P,≤〉, if cf〈P,≤〉=λ>cfλ=κ, then P must contain an antichain of size κ. We prove that for λ > cf(λ)=κ, if there exists a cardinalμ<λ such that cov(λ, μ, κ, 2)=λ, then any poset of cofinality λ contains λ κ antichains of size κ. The hypothesis of our theorem is very weak and is a consequence of many well-known axioms such as GCH, SSH and PFA. The consistency of the negation of this hypothesis is unknown.
| Original language | English |
|---|---|
| Pages (from-to) | 457-464 |
| Number of pages | 8 |
| Journal | Archive for Mathematical Logic |
| Volume | 46 |
| Issue number | 5-6 |
| DOIs | |
| State | Published - Jul 2007 |
| Externally published | Yes |
Keywords
- Antichain
- Poset
- Singular cofinality
Fingerprint
Dive into the research topics of 'Antichains in partially ordered sets of singular cofinality'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver