1971/09/01 by R. M. Solovay, S. Tennenbaum · 396 citations
Mathematics · Computer Science · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #Rings, Modules, and Algebras #Mathematics #Iterated function #Mathematical analysis
paper · doi:10.2307/1970860
published in Annals of Mathematics 94(2), 201 (Princeton University)
openalex publication_date 1971/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/14
We can characterize the real line, up to order isomorphism, by the following list of properties: R is order complete, order dense, has no first or last elements, and contains a dense subset. (One shows first that the dense is order isomorphic to the rationals, Q, and then that the ordered set is isomorphic to the Dedekind completion of its dense subset.) Souslin raised the question as to whether the countable dense subset condition could be replaced by the following consequence [15]: (*) Every disjoint family of non-empty open intervals is countable.' We use SH (Souslin's Hypothesis) to denote the following proposition: Every order complete order dense linearly ordered set satisfying ( * ) contains a dense subset. We use ZFC to denote Zermelo-Fraenkel set theory (including the axiom of choice). In [16], Tennenbaum constructed models of ZFC in which SH is false. Moreover, in one of these models the continuum hypothesis (CH) is false, while in another one, the generalized continuum hypothesis (GCH) is true. Thus SH is independent of the usual axioms of set theory. (This result is due, independently, to Jech [7].)2