Sh:288

• Shelah, S. (1992). Strong partition relations below the power set: consistency; was Sierpiński right? II. In Sets, graphs and numbers (Budapest, 1991), Vol. 60, North-Holland, Amsterdam, pp. 637–668. arXiv: math/9201244 MR: 1218224
• Abstract:
  We continue here [Sh276] but we do not relay on it. The motivation was a conjecture of Galvin stating that 2^{\omega}\geq \omega_2 + \omega_2\to [\omega_1]^{n}_{h(n)} is consistent for a suitable h:\omega\to\omega. In section 5 we disprove this and give similar negative results. In section 3 we prove the consistency of the conjecture replacing \omega_2 by 2^\omega, which is quite large, starting with an Erdős cardinal. In section 1 we present iteration lemmas which are needed when we replace \omega by a larger \lambda and in section 4 we generalize a theorem of Halpern and Lauchli replacing \omega by a larger \lambda. 2020-10-27 Two years ago have a handwritten page elaborating the proof of 2.6(1); see file 288.1810006
• Version 2022-07-04 (21p)

@incollection{Sh:288,
 author = {Shelah, Saharon},
 title = {{Strong partition relations below the power set: consistency; was Sierpi\'nski right? II}},
 booktitle = {{Sets, graphs and numbers (Budapest, 1991)}},
 series = {Colloq. Math. Soc. J\'anos Bolyai},
 volume = {60},
 year = {1992},
 pages = {637--668},
 publisher = {North-Holland, Amsterdam},
 mrnumber = {1218224},
 mrclass = {03E05 (03E35)},
 note = {\href{https://arxiv.org/abs/math/9201244}{arXiv: math/9201244}},
 arxiv_number = {math/9201244}
}