A Gitik iteration with nearly Easton factoring
Mitchell, William J.
J. Symbolic Logic, Tome 68 (2003) no. 1, p. 481- 502 / Harvested from Project Euclid
We reprove Gitik’s theorem that if the GCH holds and $o(\gk)=\gk+1$ then there is a generic extension in which $\gk$ is still measurable and there is a closed unbounded subset C of $\gk$ such that every $ν\in C$ is inaccessible in the ground model. Unlike the forcing used by Gitik, the iterated forcing $\radin\gl+1$ used in this paper has the property that if $\gl$ is a cardinal less then $\gk$ then $\radin\gl+1$ can be factored in V as $\radin\gk+1=\radin\gl+1\times\radin\gl+1,\gk$ where $\card{\radin\gl+1}\le\gl+$ and $\radin\gl+1,\gk$ does not add any new subsets of $\gl$.
Publié le : 2003-06-14
Classification: 
@article{1052669060,
     author = {Mitchell, William J.},
     title = {A Gitik iteration with nearly Easton factoring},
     journal = {J. Symbolic Logic},
     volume = {68},
     number = {1},
     year = {2003},
     pages = { 481- 502},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1052669060}
}
Mitchell, William J. A Gitik iteration with nearly Easton factoring. J. Symbolic Logic, Tome 68 (2003) no. 1, pp.  481- 502. http://gdmltest.u-ga.fr/item/1052669060/