[bibtex key=Hamkins97:Seeds]
Applying the seed concept to Prikry tree forcing
[bibtex key=Hamkins97:Seeds]
Applying the seed concept to Prikry tree forcing
A talk at the Prospects of Infinity: Workshop on Set Theory at the National University of Singapore, July 18-22, 2011.
I shall present several generalizations of the well-known Kunen inconsistency that there is no nontrivial elementary embedding from the set-theoretic universe V to itself, including generalizations-of-generalizations previously established by Woodin and others. For example, there is no nontrivial elementary embedding from the universe V to a set-forcing extension V[G], or conversely from V[G] to V, or more generally from one ground model of the universe to another, or between any two models that are eventually stationary correct, or from V to HOD, or conversely from HOD to V, or from V to the gHOD, or conversely from gHOD to V; indeed, there can be no nontrivial elementary embedding from any definable class to V. Other results concern generic embeddings, definable embeddings and results not requiring the axiom of choice. I will aim for a unified presentation that weaves together previously known unpublished or folklore results along with some new contributions. This is joint work with Greg Kirmayer and Norman Perlmutter.
A four-lecture tutorial on the topic of Boolean ultrapowers at the Young Set Theory Workshop at the Hausdorff Center for Mathematics in Königswinter near Bonn, Germany, March 21-25, 2011.
Boolean ultrapowers generalize the classical ultrapower construction on a power-set algebra to the context of an ultrafilter on an arbitrary complete Boolean algebra. Closely related to forcing and particularly to the use of Boolean-valued models in forcing, Boolean ultrapowers were introduced by Vopenka in order to carry out forcing as an internal ZFC construction, rather than as a meta-theoretic argument as in Cohen’s approach. An emerging interest in Boolean ultrapowers has arisen from a focus on the well-founded Boolean ultrapowers as large cardinal embeddings.
Historically, researchers have come to the Boolean ultrapower concept from two directions, from set theory and from model theory. Exemplifying the set-theoretic perspective, Bell’s classic (1985) exposition emphasizes the Boolean-valued model
The unifying view I will explore in this tutorial is that the well-founded Boolean ultrapowers reveal the two central concerns of set-theoretic research–forcing and large cardinals–to be two aspects of a single underlying construction, the Boolean ultrapower, whose consequent close connections might be more fruitfully explored. I will provide a thorough introduction to the Boolean ultrapower construction, while assuming only an elementary graduate student-level familiarity with set theory and the classical ultrapower and forcing techniques.