C. C. C. Forcing without Combinatorics
Mekler, Alan H.
J. Symbolic Logic, Tome 49 (1984) no. 1, p. 830-832 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
c.c.c. posets are characterised in terms of $\mathscr{N}$-generic conditions. This characterisation can be applied to get simple proofs of many facts about c.c.c. forcing including $\operatorname{Con}(MA + \neg CH)$.
Publié le : 1984-09-14
Classification:  
@article{1183741623,
     author = {Mekler, Alan H.},
     title = {C. C. C. Forcing without Combinatorics},
     journal = {J. Symbolic Logic},
     volume = {49},
     number = {1},
     year = {1984},
     pages = { 830-832},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741623}
}

Mekler, Alan H. C. C. C. Forcing without Combinatorics. J. Symbolic Logic, Tome 49 (1984) no. 1, pp.  830-832. http://gdmltest.u-ga.fr/item/1183741623/