Questa è la seconda parte dell’articolo espositivo [A]. Qui vedremo come siapossibile utilizzare il forcinge gli assiomi forti dell’infinito per dimostrare nuovi teoremi sui numeri reali.
We consider four notions of strong inaccessibility that are equivalent in ZFC and show that they are not equivalent in ZF.
Foreman (2013) proved a Duality Theorem which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of ω₁ is preserved by any proper forcing. We generalize portions of Foreman's Duality Theorem to the context of generic extender embeddings and ideal extenders (as introduced by Claverie (2010)). As an application we prove that if ω₁ is generically strong, then it remains so after adding any number of Cohen subsets...
We show the relative consistency of the existence of two strongly compact cardinals κ₁ and κ₂ which exhibit indestructibility properties for their strong compactness, together with level by level equivalence between strong compactness and supercompactness holding at all measurable cardinals except for κ₁. In the model constructed, κ₁'s strong compactness is indestructible under arbitrary κ₁-directed closed forcing, κ₁ is a limit of measurable cardinals, κ₂'s strong compactness is indestructible...
We construct a model in which there is a strong cardinal κ whose strongness is indestructible under κ-strategically closed forcing and in which level by level equivalence between strong compactness and supercompactness holds non-trivially.
We construct a model for the level by level equivalence between strong compactness and supercompactness with an arbitrary large cardinal structure in which the least supercompact cardinal κ has its strong compactness indestructible under κ-directed closed forcing. This is in analogy to and generalizes the author's result in Arch. Math. Logic 46 (2007), but without the restriction that no cardinal is supercompact up to an inaccessible cardinal.
We introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from large cardinals that it is consistent that the tree property holds at ℵₙ for n ≥ 2, is strong limit and .