Advanced Search

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, ${\aleph }_{\omega }$ is strong limit and $2^{{\aleph }_{\omega }}={\aleph }_{\omega +2}$.