Hostname: page-component-6898cfcb55-th4rj Total loading time: 0 Render date: 2026-11-11T08:59:02.369Z Has data issue: false hasContentIssue false
  • English
  • Français

C.c.c. forcing without combinatorics

Published online by Cambridge University Press:  12 March 2014

Alan H. Mekler
Alan H. Mekler*
Affiliation:
Simon Fraser University, Burnaby, British Columbia, Canada V5A 186
Get accessRights & Permissions [Opens in a new window]

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).

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 49 , Issue 3 , September 1984, pp. 830 - 832
Copyright
Copyright © Association for Symbolic Logic 1984

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

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.CrossRefGoogle Scholar
[EM]Eklof, P. and Mekler, A., On endomorphism rings of ω1-separable primary groups, Abelian group theory 1982–83, Lecture Notes in Mathematics, vol. 1006, Springer-Verlag, Berlin, 1983, pp. 320–339.CrossRefGoogle Scholar
[S]Shelah, S., Proper forcing, Lecture Notes in Mathematics, vol. 940, Springer-Verlag, Berlin, 1982.CrossRefGoogle 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.CrossRefGoogle Scholar