C. C. C. forcing without combinatorics

Journal of Symbolic Logic 49 (3):830-832 (1984)
  Copy   BIBTEX

Abstract

c.c.c. posets are characterised in terms of 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)$

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Forcing isomorphism II.M. C. Laskowski & S. Shelah - 1996 - Journal of Symbolic Logic 61 (4):1305-1320.
Forcing Isomorphism II.M. C. Laskowski & S. Shelah - 1996 - Journal of Symbolic Logic 61 (3):1305-1320.
Potential continuity of colorings.Stefan Geschke - 2008 - Archive for Mathematical Logic 47 (6):567-578.
Ladder gaps over stationary sets.Uri Abraham & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (2):518-532.
Ladder Gaps over Stationary Sets.Uri Abraham & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (2):518 - 532.
On a problem of C. H. dowker.Z. Balogh & G. Gruenhage - 1991 - Journal of Symbolic Logic 56 (4):1284-1289.
Generic trees.Otmar Spinas - 1995 - Journal of Symbolic Logic 60 (3):705-726.
Increasing the groupwise density number by c.c.c. forcing.Heike Mildenberger & Saharon Shelah - 2007 - Annals of Pure and Applied Logic 149 (1-3):7-13.

Analytics

Added to PP
2009-01-28

Downloads
194 (#104,018)

6 months
7 (#592,867)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Layered Posets and Kunen’s Universal Collapse.Sean Cox - 2019 - Notre Dame Journal of Formal Logic 60 (1):27-60.

Add more citations

References found in this work

No references found.

Add more references