加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本