A chain decomposition theorem
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.
scientific article; zbMATH DE number 4070965
scientific article