C.c.c. forcing without combinatorics

DOI10.2307/2274136zbMath0577.03025OpenAlexW2119265237MaRDI QIDQ3698792

Alan H. Mekler

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274136

zbMATH Keywords

colouringZFCMartin's axiomCohen realscountable chain conditionladder systemN-generic conditionnegation of the Continuum Hypothesis

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40)

Related Items

Universal structures in power ℵ₁, The Structure of Groups Which are Almost the Direct Sum of Countable Abelian Groups, An independence result in quadratic form theory: Infinitary combinatorics applied to ε-Hermitian spaces, DEPENDENT CHOICE, PROPERNESS, AND GENERIC ABSOLUTENESS, Choiceless chain conditions

Cites Work

• A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
• Iterated Cohen extensions and Souslin's problem