An introduction to combinatorics of determinacy

DOI10.1090/conm/752/15128zbMath1496.03204arXiv1906.04344OpenAlexW3036704952MaRDI QIDQ3299558

No author found.

Publication date: 23 July 2020

Published in: Trends in Set Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other combinatorial set theory (03E05) Partition relations (03E02) Determinacy principles (03E60)

Related Items

The size of the class of countable sequences of ordinals ⋮ More definable combinatorics around the first and second uncountable cardinals ⋮ COUNTABLE LENGTH EVERYWHERE CLUB UNIFORMIZATION ⋮ Almost disjoint families under determinacy ⋮ Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations ⋮ Definable combinatorics at the first uncountable cardinal ⋮ A Lipschitz determinacy principle equivalent to weak König lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey ultrafilters and countable-to-one uniformization
• Infinitary combinatorics and the axiom of determinateness
• Cabal seminar 76-77. Proceedings, Caltech-UCLA logic seminar 1976-77
• \(\mathbf{L}(\mathbb{R})\) with determinacy satisfies the Suslin hypothesis
• Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations
• Structural Consequences of AD
• A New Proof of the Strong Partition Relation on ω 1
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• The axiom of determinacy implies dependent choices in L(R)
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• A computation of 𝛿¹₅
• Set Theory
• A dichotomy for the definable universe
• Definable combinatorics at the first uncountable cardinal
• A Nonconstructible Δ 1 3 Set of Integers