A note on Dilworth's theorem in the infinite case (Q1093655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4023343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on Dilworth's theorem in the infinite case |
scientific article; zbMATH DE number 4023343 |
Statements
A note on Dilworth's theorem in the infinite case (English)
0 references
1987
0 references
The interesting work done in this paper was inspired by the following theorem of Dilworth: if every antichain in a poset has size \(\leq k\) (k is finite), then the poset is the union of at most k chains. The main result of this paper: if P is a poset and every antichain is finite (without assumption of existence of a finite bound on the size of the antichains), and if the length of the well-founded poset of antichains is less than \(\omega^ 2_ 1\), then P is the union of countably many chains.
0 references
theorem of Dilworth
0 references
length
0 references
well-founded poset of antichains
0 references
union of countably many chains
0 references
0.7917630672454834
0 references
0.7864419221878052
0 references
0.7813591361045837
0 references
0.7755675315856934
0 references
