Forcing Disabled
Stanley, M. C.
J. Symbolic Logic, Tome 57 (1992) no. 1, p. 1153-1175 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
It is proved (Theorem 1) that if $0^\sharp$ exists, then any constructible forcing property which over $L$ adds no reals, over $V$ collapses an uncountable $L$-cardinal to cardinality $\omega$. This improves a theorem of Foreman, Magidor, and Shelah. Also, a method for approximating this phenomenon generically is found (Theorem 2). The strategy is first to reduce the problem of `disabling' forcing properties to that of specializing certain trees in a weak sense.
Publié le : 1992-12-14
Classification:  
@article{1183744109,
     author = {Stanley, M. C.},
     title = {Forcing Disabled},
     journal = {J. Symbolic Logic},
     volume = {57},
     number = {1},
     year = {1992},
     pages = { 1153-1175},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183744109}
}

Stanley, M. C. Forcing Disabled. J. Symbolic Logic, Tome 57 (1992) no. 1, pp.  1153-1175. http://gdmltest.u-ga.fr/item/1183744109/