UCLA

This thesis divides naturally into two parts, each concerned with the extent to which the theory of L(R) can be changed by forcing.

The first part focuses primarily on applying generic-absoluteness principles to show that definable sets of reals enjoy regularity properties. We begin, in the spirit of Mathias, by establishing a strong Ramsey property for sets of reals in the Solovay model, giving a new proof of Törnquist's theorem that there are no infinite mad families in the Solovay model.

In Chapter 3 we stray from the main line of inquiry to briefly study a game-theoretic characterization of filters with the Baire Property.

Neeman and Zapletal showed, assuming roughly the existence of a proper class of Woodin cardinals, that the boldface theory of L(R) cannot be changed by proper forcing. They call their result the Embedding Theorem, because they conclude that in fact there is an elementary embedding from the ground-model L(R) to the L(R) of any proper forcing extension that fixes every ordinal and every real. With a view toward analyzing mad families under AD^+ and in L(R) under large-cardinal hypotheses, in Chapter 4 we establish triangular versions of the Embedding Theorem. These are enough for us to use Mathias's methods to show that there are no infinite mad families in L(R) under large cardinals and that AD^+ implies that there are no infinite mad families. These are again corollaries of theorems about strong Ramsey properties under large-cardinal assumptions and AD^+, respectively. Our first theorem improves the large-cardinal assumption under which Todorcevic established the nonexistence of infinite mad families in L(R).

Part I concludes with Chapter 5, a short list of open questions.

In the second part of the thesis, we conduct a finer analysis of the Embedding Theorem and its consistency strength. Schindler found that the the Embedding Theorem is consistent relative to much weaker assumptions than the existence of Woodin cardinals. He defined remarkable cardinals, which can exist even in L, and showed that the Embedding Theorem is equiconsistent with the existence of a remarkable cardinal. His theorem resembles a theorem of Kunen from the 1980s: the absoluteness of the theory of L(R) to ccc forcing extensions is equiconsistent with a weakly compact cardinal. Joint with Itay Neeman, we improve Schindler's theorem by showing that absoluteness for σ-closed * ccc posets — instead of the larger class of proper posets — implies the remarkability of aleph_1 in L. This requires a fundamental change in the proof, since Schindler's lower-bound argument uses Jensen's reshaping forcing, which, though proper, need not be σ-closed * ccc in that context. Our proof bears more resemblance to Kunen's than to Schindler's.

The proof of Theorem 6.2 splits naturally into two arguments. In Chapter 7 we extend Kunen's method of coding reals into a specializing function to allow for trees with uncountable levels that may not belong to L. This culminates in Theorem 7.4, which asserts that the failure of a Tree Reflection Principle at aleph_1 implies the failure of L(R)-absoluteness for ccc posets.

We complete the argument in Chapter 8, where we show that if the Tree Reflection Principle holds in every σ-closed extension, then aleph_1 is remarkable in L.

In Chapter 9 we review Schindler's proof of generic absoluteness from a remarkable cardinal to show that the argument gives a level-by-level upper bound.

Chapter 10 is devoted to partially reversing the level-by-level upper bound of Chapter 9. We are able to show that L(R)-absoluteness for lambda-linked posets implies that the interval [kappa,lambda] is Sigma^2_1-remarkable in L.