We extend Solovay’s theorem about definable subsets of the Baire space to the generalized Baire spaceλλ, whereλis an uncountable cardinal withλ<λ= λ. In the first main theorem, we show that the perfect set property for all subsets ofλλthat are definable from elements ofλOrd is consistent relative to the existence of an inaccessible cardinal aboveλ. In the second main theorem, we introduce a Banach–Mazur type game of lengthλand show that the determinacy of this game, for all subsets ofλλthat are definable from (...) elements ofλOrd as winning conditions, is consistent relative to the existence of an inaccessible cardinal aboveλ. We further obtain some related results about definable functions onλλand consequences of resurrection axioms for definable subsets ofλλ. (shrink)

We prove that various classical tree forcings—for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing—preserve the statement that every real has a sharp and hence analytic determinacy. We then lift this result via methods of inner model theory to obtain level-by-level preservation of projective determinacy (PD). Assuming PD, we further prove that projective generic absoluteness holds and no new equivalence classes are added to thin projective transitive relations by these forcings.