Skip to main content Accessibility help

sets and singletons

  • Kai Hauser (a1) and W. Hugh Woodin (a2)


We extend work of H. Friedman, L. Harrington and P. Welch to the third level of the projective hierarchy. Our main theorems say that (under appropriate background assumptions) the possibility to select definable elements of non-empty sets of reals at the third level of the projective hierarchy is equivalent to the disjunction of determinacy of games at the second level of the projective hierarchy and the existence of a core model (corresponding to this fragment of determinacy) which must then contain all real numbers. The proofs use Sacks forcing with perfect trees and core model techniques.



Hide All
[1] Dodd, A. J., The core model, London Mathematical Society Lecture Note Series, no. 61, 1984, xxxviii + 229 pp.
[2] Friedman, H., unpublished.
[3] Gödel, K., The consistency of the axiom of choice and the generalized continuum hypothesis, Proceedings of the National Academy of Sciences of the USA, vol. 24 (1938), pp. 556–557.
[4] Gödel, K., The consistency of the axiom of choice and of the generalized continuum hypothesis with the axioms of set theory, Annals of Mathematical Studies, Study 3, Princeton University Press, Princeton, New Jersey, 1940.
[5] Harrington, L., sets and singletons, American Mathematical Society, vol. 52 (1975), pp. 356–360.
[6] Hauser, K., Sets of reals, infinite games and core model theory, Proceedings of the 6th Asian Logic Conference, Beijing 1996, World Scientific Publishing Co., Singapore, 1998, pp. 107–120.
[7] Jech, T., Set theory, Academic Press, 1978, xi + 621 pp.
[8] Kondo, M., Sur l'uniformization des complementaires analytiques et les ensembles projectifs de la second classe, Japanese Journal of Mathematics, vol. 15 (1938), pp. 197–230.
[9] Kunen, K., Set theory, North-Holland, 1980.
[10] Mansfield, R., The nonexistence of wellorderings of the Baire space, Fundamenta Mathematical, vol. 86 (1975), pp. 279–281.
[11] Martin, D. A. and Solovay, R. M., A basis theorem for sets of reals, Annals of Mathematics, vol. 89 (1969), pp. 138–160.
[12] Martin, D. A. and Steel, J. R., Iteration trees, Journal of the American Mathematical Society, vol. 7 (1994), pp. 1–73.
[13] Mitchell, W. J. and Steel, J. R., Fine structure and iteration trees, Lecture Notes in Logic, no. 3, Springer-Verlag, 1994, 130 pp.
[14] Moschovakis, Y. N., Descriptive set theory, North-Holland, 1980, xii + 637 pp.
[15] Sacks, G., Forcing with perfect closed sets, Axiomatic set theory (Scott, D., editor), vol. 13, Proceedings of Symposia in Pure Mathematics, no. II, American Mathematical Society, Providence, Rhode Island, 1971, pp. 331–355.
[16] Shoenfield, J., The problem of predicativity, Essays on the foundation of mathematics (Bar-Hillel, Y. et al., editors), The Magnes Press, Jerusalem, 1961, pp. 132–142.
[17] Steel, J. R., The core model iterability problem, Lecture Notes in Logic, no. 8. Springer-Verlag, 1996, 112 pp.
[18] Welch, P., Some descriptive set theory and core models, Annals of Pure and Applied Logic, vol. 39 (1989), pp. 273–290.
[19] Woodin, W. H., Mathias, A. R. D., and Hauser, K., The axiom of determinacy, monograph in preparation.


Related content

Powered by UNSILO

sets and singletons

  • Kai Hauser (a1) and W. Hugh Woodin (a2)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.