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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

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

Mapping a set of reals onto the reals.Arnold W. Miller - 1983 - Journal of Symbolic Logic 48 (3):575-584.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
On the constructive Dedekind reals.Robert S. Lubarsky & Michael Rathjen - 2008 - Logic and Analysis 1 (2):131-152.
Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
Multistage Game Models and Delay Supergames.Reinhard Selten - 1998 - Theory and Decision 44 (1):1-36.
A basis theorem for perfect sets.Marcia J. Groszek & Theodore A. Slaman - 1998 - Bulletin of Symbolic Logic 4 (2):204-209.

Analytics

Added to PP
2009-01-28

Downloads
46 (#328,927)

6 months
28 (#103,268)

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.
Mathematical Logic.J. Donald Monk - 2001 - Bulletin of Symbolic Logic 7 (3):376-376.

Add more references