Strong partition relations below the power set: consistency, was Sierpinski right, II?
Saharon Shelah
Abstract
We continue here [She88] but we do not rely on it. The motivation was a conjecture of Galvin stating that 2omega >= omega2 + omega2-> [omega1]nh(n) is consistent for a suitable h: omega-> omega. In section 5 we disprove this and give similar negative results. In section 3 we prove the consistency of the conjecture replacing omega2 by 2omega, which is quite large, starting with an Erdos 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 .
Create a lesson
Related papers
Stalnaker's logical problem of conditionals is unsolvable
Alexander W. Kocurek, James Walsh, Yale Weiss
Strong completeness of the logic J
Juan P. Aguilera, Grigorii Stepanov
Lévy-Montague reflection is Π11-conservative over WKL0
Fedor Pakhomov
Contact relations on bounded distributive lattices and related structures
Ivo Düntsch, Rafał Gruszczyński
Embeddings of Propositional Logics into the Provability Logics S and D
Mashu Noguchi
Some results on NIP groups and their Ellis groups
Atticus Stonestrom