The Perfect Set Theorem and Definable Wellorderings of the Continuum
Kechris, Alexander S.
J. Symbolic Logic, Tome 43 (1978) no. 1, p. 630-634 / Harvested from Project Euclid
Let $\Gamma$ be a collection of relations on the reals and let $M$ be a set of reals. We call $M$ a perfect set basis for $\Gamma$ if every set in $\Gamma$ with parameters from $M$ which is not totally included in $M$ contains a perfect subset with code in $M$. A simple elementary proof is given of the following result (assuming mild regularity conditions on $\Gamma$ and $M$): If $M$ is a perfect set basis for $\Gamma$, the field of every wellordering in $\Gamma$ is contained in $M$. An immediate corollary is Mansfield's Theorem that the existence of a $\Sigma^1_2$ wellordering of the reals implies that every real is constructible. Other applications and extensions of the main result are also given.
Publié le : 1978-12-14
Classification: 
@article{1183740308,
     author = {Kechris, Alexander S.},
     title = {The Perfect Set Theorem and Definable Wellorderings of the Continuum},
     journal = {J. Symbolic Logic},
     volume = {43},
     number = {1},
     year = {1978},
     pages = { 630-634},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740308}
}
Kechris, Alexander S. The Perfect Set Theorem and Definable Wellorderings of the Continuum. J. Symbolic Logic, Tome 43 (1978) no. 1, pp.  630-634. http://gdmltest.u-ga.fr/item/1183740308/