We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu $ such that the singular cardinal hypothesis fails at $\nu $ and every collection of fewer than $\operatorname {\mathrm {cf}}(\nu )$ stationary subsets of $\nu ^{+}$ reflects simultaneously. For $\operatorname {\mathrm {cf}}(\nu )> \omega $, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for $\operatorname {\mathrm {cf}}(\nu ) = \omega $ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.
We prove several consistency results concerning the notion of $\omega $-strongly measurable cardinal in $\operatorname {\mathrm {HOD}}$. In particular, we show that is it consistent, relative to a large cardinal hypothesis weaker than $o(\kappa ) = \kappa $, that every successor of a regular cardinal is $\omega $-strongly measurable in $\operatorname {\mathrm {HOD}}$.
We provide a model theoretical and tree property-like characterization of $\lambda $-$\Pi ^1_1$-subcompactness and supercompactness. We explore the behavior of these combinatorial principles at accessible cardinals.
In this paper we study the notion of $C^{(n)}$-supercompactness introduced by Bagaria in [3] and prove the identity crises phenomenon for such class. Specifically, we show that consistently the least supercompact is strictly below the least $C^{(1)}$-supercompact but also that the least supercompact is $C^{(1)}$-supercompact (and even $C^{(n)}$-supercompact). Furthermore, we prove that under suitable hypothesis the ultimate identity crises is also possible. These results solve several questions posed by Bagaria and Tsaprounis.
We present an alternative proof that from large cardinals, we can force the tree property at $\kappa ^+$ and $\kappa ^{++}$ simultaneously for a singular strong limit cardinal $\kappa $. The advantage of our method is that the proof of the tree property at the double successor is simpler than in the existing literature. This new approach also works to establish the result for $\kappa =\aleph _{\omega ^2}$.
We construct a model in which the tree property holds in ${\aleph _{\omega + 1}}$ and it is destructible under $Col\left( {\omega ,{\omega _1}} \right)$. On the other hand we discuss some cases in which the tree property is indestructible under small or closed forcings.
In this paper, we consider Foreman’s maximality principle, which says that any nontrivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We observe that it is consistent that every c.c.c. forcing adds a real and that for every uncountable regular cardinal κ, every κ-closed forcing of size 2<κ collapses some cardinal.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.