A forcing proof of the Kechris-Moschovakis constructibility theorem
HTML articles powered by AMS MathViewer
- by Andreas Blass PDF
- Proc. Amer. Math. Soc. 47 (1975), 195-197 Request permission
Abstract:
We show, by forcing, that every subset of ${\aleph _1}$ whose codes form a $\Sigma _2^1$ set of reals must be constructible.References
- Alexander S. Kechris and Yiannis N. Moschovakis, Two theorems about projective sets, Israel J. Math. 12 (1972), 391–399. MR 323544, DOI 10.1007/BF02764630
- J. R. Shoenfield, Unramified forcing, Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) Amer. Math. Soc., Providence, R.I., 1971, pp. 357–381. MR 0280359 R. M. Solovay, Measurable cardinals and the axiom of determinateness, Lecture notes for Summer Institute on axiomatic set theory, UCLA (1967).
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 47 (1975), 195-197
- DOI: https://doi.org/10.1090/S0002-9939-1975-0351819-2
- MathSciNet review: 0351819