L(ℝ) with Determinacy Satisfies the Suslin Hypothesis

2018/03/22 by William Chan, Chan, William, Stephen Jackson +1
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1803.08201

openalex publication_date 2018/03/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. \mathsfZF + AD⁺ + V = L(\mathscrP(ℝ)) proves the Suslin hypothesis. In particular, if L(ℝ) \models AD, then L(ℝ) satisfies the Suslin hypothesis, which answers a question of Foreman.

Related

• Linear Orders and the Real Line
• The Largest Suslin Axiom
• Building Models of Determinacy from Below
• A model with Suslin trees but no minimal uncountable linear orders other than ω₁ and -ω₁
• A model of the Axiom of Determinacy in which every set of reals is universally Baire