Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T18:44:45.913Z Has data issue: false hasContentIssue false

sets and singletons

Published online by Cambridge University Press:  12 March 2014

Kai Hauser
Affiliation:
Department of Mathematics, University of California, Berkeley, CA 94720., USA E-mail: hauser@math.berkeley.edu
W. Hugh Woodin
Affiliation:
Department of Mathematics, University of California, Berkeley, CA 94720., USA E-mail: woodin@math.berkeley.edu

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

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.)

Article purchase

Temporarily unavailable