A note on Dilworth's theorem in the infinite case

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


If ℘ is a poset and every antichain is finite, and if the length of the well-founded poset of antichains is less than ω21, then ℘ is the union of countably many chains. We also compute the length of the poset of antichains in the product of two ordinals, αxβ.

Original languageEnglish
Pages (from-to)107-125
Number of pages19
Issue number2
StatePublished - 1 Jun 1987


  • AMS subject classifications (1980): 03E05 Combinatorial set theory, 03E10 Ordinal and cardinal numbers, 06A10 Partial order
  • Poset
  • antichain
  • chain

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'A note on Dilworth's theorem in the infinite case'. Together they form a unique fingerprint.

Cite this