\(\mathbf{L}(\mathbb{R})\) with determinacy satisfies the Suslin hypothesis

DOI10.1016/j.aim.2019.02.012OpenAlexW2913765211MaRDI QIDQ1731564

Xianqiang Yang

Publication date: 13 March 2019

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.08201

zbMATH Keywords

determinacySuslin linesVopenka forcing

Mathematics Subject Classification ID

Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Other combinatorial set theory (03E05) Determinacy principles (03E60)

Related Items (4)

-definability at higher cardinals: Thin sets, almost disjoint families and long well-orders ⋮ Almost disjoint families under determinacy ⋮ An introduction to combinatorics of determinacy ⋮ Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set theory. Exploring independence and truth
• A model of set-theory in which every set of reals is Lebesgue measurable
• Iterated Cohen extensions and Souslin's problem
• Determinacy in L(ℝ)
• Borel Orderings
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• The axiom of determinacy implies dependent choices in L(R)
• Set Theory
• A dichotomy for the definable universe
• SOUSLIN'S PROBLEM

This page was built for publication: \(\mathbf{L}(\mathbb{R})\) with determinacy satisfies the Suslin hypothesis