Indexed metadata

General Criterion for a Poset to Admit a Partition Into ωω-Chains

Remi Salinas Schmeis

Source record

Source: arXiv

Published: Oct 21, 2026

arXiv: 2610.29056

Open original source ↗

Source abstract

Given a poset PP with no maximal element the question naturally arises of when PP 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.