Strong partition relations below the power set: consistency, was Sierpinski right, II?

Details Strong partition relations below the power set: consistency, was Sierpinski right, II? Strong partition relations below the power set: consistency, was Sierpinski right, II?

1991-01-15

arxiv.org/abs/math/9201244v1

Colloq. Math. Soc. Janos Bolyai 60 (1991), 637--638

Mathematics

Logic

Scientific paper

We continue here [Sh276] but we do not relay on it. The motivation was a conjecture of Galvin stating that 2^{omega} >= omega_2 + omega_2-> [omega_1]^{n}_{h(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 omega_2 by 2^omega, which is quite large, starting with an Erd\H{o}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 .

Affiliated with

Also associated with

No associations

Rating

Strong partition relations below the power set: consistency, was Sierpinski right, II? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strong partition relations below the power set: consistency, was Sierpinski right, II?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strong partition relations below the power set: consistency, was Sierpinski right, II? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144890