Coloring finite subsets of uncountable sets

Authors:
Péter Komjáth and Saharon Shelah

Journal:
Proc. Amer. Math. Soc. **124** (1996), 3501-3505

MSC (1991):
Primary 03E35

DOI:
https://doi.org/10.1090/S0002-9939-96-03450-8

MathSciNet review:
1342032

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: It is consistent for every that and there is a function such that every finite set can be written in at most ways as the union of two distinct monocolored sets. If GCH holds, for every such coloring there is a finite set that can be written at least ways as the union of two sets with the same color.

**1.**J. E. Baumgartner and S. Shelah,*Remarks on superatomic Boolean algebras*, Annals of Pure and Applied Logic**33**(1987), 109--129. MR**88d:03100****2.**P. Erd\H{o}s, A. Hajnal, A. Máté, and R. Rado,*Combinatorial Set Theory: Partition Relations for Cardinals*, Studies in Logic,**106**, North-Holland, 1984. MR**87j:04002****3.**P. Erd\H{o}s and R. Rado,*A partition calculus in set theory*, Bull. Amer. Math. Soc.**62**(1956), 427--489. MR**18:458a****4.**M. Gilchrist and S. Shelah,*On identities of colorings of pairs for*(to appear).**5.**P. Komjáth,*A set mapping with no infinite free subsets*, Journal of Symbolic Logic**56**(1991), 1400--1402. MR**92i:03054****6.**P. Komjáth and S. Shelah,*On uniformly antisymmetric functions*, Real Analysis Exchange**19**(1993--1994), 218--225. MR**95b:26001****7.**S. Shelah and L. Stanley,*A theorem and some consistency results in partition calculus*, Annals of Pure and Applied Logic**36**(1987), 119--152. MR**89d:03045**

Retrieve articles in *Proceedings of the American Mathematical Society*
with MSC (1991):
03E35

Retrieve articles in all journals with MSC (1991): 03E35

Additional Information

**Péter Komjáth**

Affiliation:
Department of Computer Science, Eötvös University, Budapest, Múzeum krt. 6–8, 1088, Hungary

Email:
kope@cs.elte.hu

**Saharon Shelah**

Affiliation:
Institute of Mathematics, Hebrew University, Givat Ram, 91904, Jerusalem, Israel

Email:
shelah@math.huji.ac.il

DOI:
https://doi.org/10.1090/S0002-9939-96-03450-8

Keywords:
Axiomatic set theory,
independence proofs,
combinatorial set theory

Received by editor(s):
March 31, 1995

Received by editor(s) in revised form:
May 9, 1995

Additional Notes:
The first author was supported by the Hungarian OTKA, Grant No. T014105.\endgraf This paper is number 516 in the cumulative list of Shelah’s papers. His research was supported by the Basic Research Foundation of the Israel Academy of Sciences and Humanities.

Communicated by:
Andreas R. Blass

Article copyright:
© Copyright 1996
American Mathematical Society