C.c.c. forcing without combinatorics

Alan H. Mekler

doi:10.2307/2274136

Abstract

c.c.c. posets are characterised in terms of -generic conditions. This characterisation can be applied to get simple proofs of many facts about c.c.c. forcing including Con(MA + ┐CH).

References

REFERENCES

[DS]Devlin, K. and Shelah, S., A weak version of ⟡ which follows from 2^ℵ0 < 2^ℵ1, Israel Journal of Mathematics, vol. 29 (1978), pp. 239–247.CrossRef Google Scholar

[EM]Eklof, P. and Mekler, A., On endomorphism rings of ω₁-separable primary groups, Abelian group theory 1982–83, Lecture Notes in Mathematics, vol. 1006, Springer-Verlag, Berlin, 1983, pp. 320–339.CrossRef Google Scholar

[S]Shelah, S., Proper forcing, Lecture Notes in Mathematics, vol. 940, Springer-Verlag, Berlin, 1982.CrossRef Google Scholar

[ST]Solovay, R. and Tennenbaum, S., Iterated Cohen extensions and Souslin's problem, Annals of Mathematics, ser. 2, vol. 94 (1971), pp. 201–245.CrossRef Google Scholar

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Mekler, Alan H. 1987. The structure of groups which are almost the direct sum of countable abelian groups. Transactions of the American Mathematical Society, Vol. 303, Issue. 1, p. 145.

1990. Almost Free Modules - Set-theoretic Methods. Vol. 46, Issue. , p. 456.

Eklof, Paul C. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 328.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 191.

2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 563.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 476.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 316.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 401.

Eklof, Paul C. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 363.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 55.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 123.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 292.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 1.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 264.

Eklof, Paul C. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 85.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 498.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 17.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 527.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 441.

Eklof, Paul C. and Mekler, Alan H. 2002. Almost Free Modules - Set-theoretic Methods. Vol. 65, Issue. , p. 143.

Download full list

Article contents

C.c.c. forcing without combinatorics

Abstract

Access options

References

REFERENCES

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

C.c.c. forcing without combinatorics

Abstract

Access options

References

REFERENCES

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests