×

Partitions of the set of finite sequences. (English) Zbl 0847.03022

The authors study the collection \(C\) of all infinite cardinals \(\kappa\) with the property that for every \(F : \bigcup_{n \in \omega} {}^n\kappa \to 2\), there are \(H_i \subseteq \kappa\) for \(i \in \omega\) such that (a) \(|H_i|= 2\) for each \(i \in \omega\), and (b) \(F\) is constant on \(\prod^n_{i = 0} H_i\) for every \(n \in \omega\). It is immediate that if \(\kappa\) lies in \(C\), then so does every larger cardinal. Hence the main problems are (1) to determine whether \(C\) has any element, and (2) to describe the least element of \(C\) in case \(C\) is nonempty. The authors also consider larger collections obtained by replacing (a) by \((\text{a}')\): \(|H_i|= 2\) for infinitely many \(i\), and (b) by \((\text{b}')\): \(F\) is constant on \(\prod^n_{i = 0} H_i\) for infinitely many \(n\).
Reviewer: P.Matet (Caen)

MSC:

03E05 Other combinatorial set theory
05A18 Partitions of sets
Full Text: DOI

References:

[1] Carnielli, W. A.; Di Prisco, C. A., Some results on polarized partition relations of higher dimension, Quart. Math. Logic, 39, 461-474 (1993) · Zbl 0805.03035
[2] Di Prisco, C. A.; Henle, J. M., Partitions of products, J. Symbolic Logic, 58, 860-871 (1993) · Zbl 0831.04003
[3] Erdös, P.; Rado, R., A partition calculus in set theory, Bull. Amer. Math. Soc., 62, 427-489 (1956) · Zbl 0071.05105
[4] Erdös, P.; Hajnal, A.; Rado, R., Partition relations for cardinal numbers, Acta Math. Acad. Sci. Hungar., 16, 93-196 (1965) · Zbl 0158.26603
[5] J. Henle; J. Henle
[6] Williams, N. H., Combinatorial Set Theory (1977), North-Holland: North-Holland Amsterdam · Zbl 0362.04008
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.