We consider the possible complexity of the set of reals belonging to an inner model M of set theory. We show that if this set is analytic then either 1M is countable or else all reals are in M. We also show that if an inner model contains a superperfect set of reals as a subset then it contains all reals. On the other hand, it is possible to have an inner model M whose reals are an uncountable Fσ set (...) and which does not have all reals. A similar construction shows that there can be an inner model M which computes correctly 1, contains a perfect set of reals as a subset and yet not all reals are in M. These results were motivated by questions of H. Friedman and K. Prikry. (shrink)

We prove that every analytic set in ω ω × ω ω with σ-bounded sections has a not σ-bounded closed free set. We show that this result is sharp. There exists a closed set with bounded sections which has no dominating analytic free set, and there exists a closed set with non-dominating sections which does not have a not σ-bounded analytic free set. Under projective determinacy analytic can be replaced in the above results by projective.