General Criterion for a Poset to Admit a Partition Into -Chains
Remi Salinas Schmeis
Source abstract
Given a poset with no maximal element the question naturally arises of when can be partitioned into -chains. In this paper we give general criterion for when this can be done. We show that in the case when a poset with no maximal element is countable or a well-founded forest, then it can always be partitioned into -chains. We then introduce the lifting property for posets with no maximal element and show that a poset can be partitioned into -chains if and only if it has the lifting property.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.