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 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 .
Create a lesson
Related papers
An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees (short version)
Jean Abou Samra, David A. Madore
Solving polynomials in large pseudo-finite sets
Alessandro Vegnuti
Idiosynchromatic Poetry
Thilo Weinert
Free Tn-Heyting algebras
Juan Manuel Cornejo, Andrés Gallardo, Paula Helt et al.
A true Π01 sentence independence of PA
Mohammad Golshani
Ultrahomogeneous hypertournaments
Rob Sullivan