An introduction to Pmax forcing
نویسنده
چکیده
These notes are an account of a six-hour lecture series I presented at Carnegie Mellon University on September 9, 2006, as the inaugural meeting of the Appalachian Set Theory series. My remarks (occasionally improvised) were faithfully transcribed by Peter LeFanu Lumsdaine and Yimu Yin, who then presented me with a rough draft of this article. Their account aimed to capture the feel of the discussions (including some direct quotations), and I’ve tried to preserve that as much as possible.
منابع مشابه
SQUARE PRINCIPLES IN Pmax EXTENSIONS
By forcing with Pmax over strong models of determinacy, we obtain models where different square principles at ω2 and ω3 fail. In particular, we obtain a model of 2א0 = 2א1 = א2 + ¬ (ω2) + ¬ (ω3).
متن کاملPmax VARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES
In his book on Pmax [6], Woodin presents a collection of partial orders whose extensions satisfy strong club guessing principles on ω1. In this paper we employ one of the techniques from this book to produce Pmax variations which separate various club guessing principles. The principle (+) and its variants are weak guessing principles which were first considered by the second author [3] while s...
متن کاملWoodin's Axiom ( * ), Bounded Forcing Axioms, and Precipitous Ideals on Ω 1
If the Bounded Proper Forcing Axiom BPFA holds, then Mouse Reflection holds at א2 with respect to all mouse operators up to the level of Woodin cardinals in the next ZFC–model. This yields that if Woodin’s Pmax axiom (∗) holds, then BPFA implies that V is closed under the “Woodin-in-the-nextZFC–model” operator. We also discuss stronger Mouse Reflection principles which we show to follow from st...
متن کاملWoodin's axiom (*), bounded forcing axioms, and precipitous ideals on ω₁
If the Bounded Proper Forcing Axiom BPFA holds, then Mouse Reflection holds at א2 with respect to all mouse operators up to the level of Woodin cardinals in the next ZFC–model. This yields that if Woodin’s Pmax axiom (∗) holds, then BPFA implies that V is closed under the “Woodin-in-the-nextZFC–model” operator. We also discuss stronger Mouse Reflection principles which we show to follow from st...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کامل