The perfect set theorem and definable wellorderings of the continuum

Journal of Symbolic Logic 43 (4):630-634 (1978)
  Copy   BIBTEX

Abstract

Let Γ be a collection of relations on the reals and let M be a set of reals. We call M a perfect set basis for Γ if every set in Γ 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 Γ and M): If M is a perfect set basis for Γ, the field of every wellordering in Γ is contained in M. An immediate corollary is Mansfield's Theorem that the existence of a Σ 1 2 wellordering of the reals implies that every real is constructible. Other applications and extensions of the main result are also given

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,173

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A basis theorem for perfect sets.Marcia J. Groszek & Theodore A. Slaman - 1998 - Bulletin of Symbolic Logic 4 (2):204-209.
Complexity of reals in inner models of set theory.Boban Velickovic & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
Complexity of reals in inner models of set theory.Boban Velickovic & Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
The γ-borel conjecture.Arnold W. Miller - 2005 - Archive for Mathematical Logic 44 (4):425-434.
The elementary theory of Dedekind cuts in polynomially bounded structures.Marcus Tressl - 2005 - Annals of Pure and Applied Logic 135 (1-3):113-134.

Analytics

Added to PP
2009-01-28

Downloads
67 (#314,444)

6 months
9 (#480,483)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references