$L(\mathbb{R})$ with Determinacy Satisfies the Suslin Hypothesis
William Chan, Stephen Jackson

TL;DR
This paper proves that under certain set-theoretic assumptions involving determinacy and the constructible universe over the reals, the Suslin hypothesis holds, ruling out the existence of certain complex linear orders.
Contribution
It demonstrates that $L(R)$ models the Suslin hypothesis assuming $ ext{ZF} + ext{AD}^+ + V=L(P(R))$, answering a longstanding question.
Findings
$L(R)$ with determinacy satisfies the Suslin hypothesis.
The result holds under $ ext{ZF} + ext{AD}^+ + V=L(R)$.
Provides a set-theoretic consistency proof for the Suslin hypothesis in this context.
Abstract
The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. proves the Suslin hypothesis. In particular, if , then satisfies the Suslin hypothesis, which answers a question of Foreman.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · semigroups and automata theory
