Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-25T08:54:55.385Z Has data issue: false hasContentIssue false

On partitions into stationary sets

Published online by Cambridge University Press:  12 March 2014

Karel Prikry
Affiliation:
University of Minnesota, Minneapolis, Minnesota 55455
Robert M. Solovay
Affiliation:
University of California, Berkeley, California 94720

Extract

We shall apply some of the results of Jensen [4] to deduce new combinatorial consequences of the axiom of constructibility, V = L. We shall show, among other things, that if V = L then for each cardinal λ there is a set A ⊆ λ such that neither A nor λ – A contain a closed set of type ω1. This is an extension of a result of Silver who proved it for λ = ω2, providing a partial answer to Problem 68 of Friedman [2].

The main results of this paper were obtained independently by both authors.

If λ is an ordinal, E is said to be Mahlo (or stationary) in λ, if λ – E does not contain a closed cofinal subset of λ.

Consider the statements:

(J1) There is a class E of limit ordinals and a sequence Cλ defined on singular limit ordinals λ such that

(i) E ⋂ μ is Mahlo in μ for all regular > ω;

(ii) Cλ is closed and unbounded in λ;

(iii) if γ < is a limit point of Cλ, then γ is singular, γ ∉ E and Cγ = γ ⋂ Cλ.

For each infinite cardinal κ:

(J2,κ) There is a set E ⊂ κ+ and a sequence Cλ(Lim(λ), λ < κ+) such that

(i) E is Mahlo in κ+;

(ii) Cλ is closed and unbounded in λ;

(iii) if cf(λ) < κ, then card Cλ < κ;

(iv) if γ < λ is a limit point of Cλ then γ ∉ E and Cγ = ϣ ⋂ Cλ.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1975

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]Friedman, H., On closed sets of ordinals, Proceedings of the American Mathematical Society, vol. 43 (1974), pp. 190192.CrossRefGoogle Scholar
[2]Friedman, H., Ninety-four problems in mathematical logic (to appear).Google Scholar
[3]Jech, T. J., Some combinatorial problems concerning uncountable cardinals, Annals of Mathematical Logic, vol. 5 (1973), pp. 165198.CrossRefGoogle Scholar
[4]Jensen, R. B., The fine structure of the constructible hierarchy, Annals of Mathematical Logic, vol. 4 (1972), pp. 229308.CrossRefGoogle Scholar