Was Sierpiński right? III. Can continuum-c.c. times c.c.c. be continuum-c.c.? (Q1919771): Difference between revisions

[For Parts I and II see Isr. J. Math. 62, No. 3, 355-380 (1988; Zbl 0657.03028) and Colloq. Math. Soc. János Bolyai 60, 637-668 (1992; Zbl 0808.03030), respectively.] The author proves that, consistently, all products \(\mathbb{P} \times \mathbb{Q}\), with \(\mathbb{P}\) a ccc poset and \(\mathbb{Q}\) a \(2^{\aleph_0}\)-cc poset may be \(2^{\aleph_0}\)-cc. The proof uses a finite support iteration of length \(\lambda\), where \(\lambda\) is a Ramsey cardinal. In the end \(2^{\aleph_0} = \lambda\) and the following condition, akin to Knaster's condition, holds: in every \(\lambda\)-cc Boolean algebra every set of size \(\lambda\) contains an \(\aleph_1\)-sized subset with the finite intersection property.