A chain decomposition theorem (Q1109796)
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 4070965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A chain decomposition theorem |
scientific article; zbMATH DE number 4070965 |
Statements
A chain decomposition theorem (English)
0 references
1988
0 references
The author proves that a poset (1) such that every point together with a finite set of elements incomparable with it form a cutset and (2) such that any bounded countable chain has sup and inf is the union of countably many chains. The proof uses the height of a poset of 2 element chains.
0 references
finite cutset property
0 references
Chain decomposition of posets
0 references
sigma-chain complete poset
0 references
0.7813591361045837
0 references
0.7807530760765076
0 references
0.7737563252449036
0 references
0.7713268399238586
0 references
