1991Journal of the American Mathematical SocietyOpen access

A Partition Theorem for Pairs of Finite Sets

Thomas Jech, Saharon Shelah

Open full text 2 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Partition Theorem for Pairs of Finite Sets — Research Paper | ScholarLens