Suslin's problem
Let be a non-empty, dense, complete linear order without endpoints such that every collection of pairwise disjoint non-empty open intervals in is countable (the countable chain condition, ccc). Must be order-isomorphic to the real line ?
Thomas Jech (1967) and Stanley Tennenbaum (1968) constructed forcing models containing Suslin lines (refuting Suslin's Hypothesis), Ronald Jensen (1968) proved that Suslin lines exist in Gödel's constructible universe via the diamond principle , and Robert Solovay and Tennenbaum (1971) invented iterated forcing to prove that Suslin's Hypothesis holds under .
In 1972 Ronald Jensen proved that the Generalized Continuum Hypothesis (GCH) is also compatible with Suslin's Hypothesis by introducing morasses and fine-structure forcing, showing that CH alone does not decide the existence of Suslin trees.
References
- Robert M. Solovay, Stanley Tennenbaum (1971). Iterated Cohen extensions and Souslin's problem · DOI:10.2307/1970745
- Ronald B. Jensen (1972). The fine structure of the constructible hierarchy · DOI:10.1016/0003-4843(72)90001-0
- Thomas Jech (2003). Set Theory