Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-05T16:29:36.545Z Has data issue: false hasContentIssue false

Partitioning pairs of countable sets of ordinals

Published online by Cambridge University Press:  12 March 2014

Dan Velleman*
Affiliation:
Department of Mathematics, Amherst College, Amherst, Massachusetts 01002

Extract

In [3], Todorčević showed that ω1 ⇸ [ω1]ω12. In this paper we use similar methods to prove an analogous partition theorem for Pω1(λ), for certain uncountable cardinals λ.

Recall that ω1 → [ω1]ω12, means that for every function f: [ω1]2ω1 there is a set A ∈ [ω1]ω1 such that f“[A]2ω1, and of course ω1 ⇸ [ω1]ω12, is the negation of this statement. For partition relations on Pω1() it is customary to partition only those pairs of sets in which the first set is a subset of the second. Thus for APω1(λ) we define

We will write Pω1(λ) → [unbdd]λ2 to mean that for every function f: [Pω1(λ)]2λ there is an unbounded set APω1(λ) such that f“[A]2λ, and again Pω1(λ) ⇸ [unbdd]λ2 is the negation of this statement.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Jech, T., Some combinatorial problems concerning uncountable cardinals, Annals of Mathematical Logic, vol. 5 (1973), pp. 165198.CrossRefGoogle Scholar
[2]Matsubara, Y., Menas' conjecture and generic ultrapowers, Annals of Pure and Applied Logic, vol. 36 (1987), pp. 225234.CrossRefGoogle Scholar
[3]Todorčević, S., Partitioning pairs of countable ordinals, Acta Mathematica, vol. 159 (1987), pp. 261294.CrossRefGoogle Scholar
[4]Zwicker, W., Pκλ combinatorics. I: Stationary coding sets rationalize the club filter, Axiomatic set theory (Baumgartner, J.et al., editors), American Mathematical Society, Providence, Rhode Island, 1984, pp. 243259.CrossRefGoogle Scholar