A Partition Theorem for Pairs of Finite Sets
Thomas Jech, Saharon Shelah
Abstract
Open-access reader
Thomas Jech, Saharon Shelah
Abstract
Open-access reader
Every partition of ${[{[{\omega _1}]^{ < \omega }}]^2}$ into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite character.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Every partition of ${[{[{\omega _1}]^{ < \omega }}]^2}$ into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite character.
Key concepts: Mathematics, Partition (number theory), Omega, Homogeneous, Combinatorics, Partition of unity, Pure mathematics, Set (abstract data type)