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.
Publié le : 1999-06-14
Classification:
Set Theory,
Descriptive Set Theory,
Core Models,
Definable Singletons,
03E15,
04A15,
03E60,
03E45,
03E55,
03E35,
03E60
@article{1183745795,
author = {Hauser, Kai and Woodin, W. Hugh},
title = {$\Pi^1\_3$ Sets and $\Pi^1\_3$ Singletons},
journal = {J. Symbolic Logic},
volume = {64},
number = {1},
year = {1999},
pages = { 590-616},
language = {en},
url = {http://dml.mathdoc.fr/item/1183745795}
}
Hauser, Kai; Woodin, W. Hugh. $\Pi^1_3$ Sets and $\Pi^1_3$ Singletons. J. Symbolic Logic, Tome 64 (1999) no. 1, pp. 590-616. http://gdmltest.u-ga.fr/item/1183745795/