An introduction to combinatorics of determinacy
From MaRDI portal
Publication:3299558
DOI10.1090/CONM/752/15128zbMATH Open1496.03204arXiv1906.04344OpenAlexW3036704952MaRDI QIDQ3299558FDOQ3299558
Authors:
Publication date: 23 July 2020
Published in: Trends in Set Theory (Search for Journal in Brave)
Abstract: This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.
Full work available at URL: https://arxiv.org/abs/1906.04344
Partition relations (03E02) Other combinatorial set theory (03E05) Descriptive set theory (03E15) Determinacy principles (03E60)
Cites Work
- Title not available (Why is that?)
- Set Theory
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- Counting the number of equivalence classes of Borel and coanalytic equivalence relations
- Ramsey ultrafilters and countable-to-one uniformization
- A dichotomy for the definable universe
- Cabal seminar 76-77. Proceedings, Caltech-UCLA logic seminar 1976-77
- A trichotomy theorem in natural models of \(\text{AD}^+\)
- Infinitary combinatorics and the axiom of determinateness
- Structural consequences of AD
- Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations
- A Nonconstructible Δ 1 3 Set of Integers
- Title not available (Why is that?)
- \(\mathbf{L}(\mathbb{R})\) with determinacy satisfies the Suslin hypothesis
- Title not available (Why is that?)
- The axiom of determinacy implies dependent choices in L(R)
- Title not available (Why is that?)
- A New Proof of the Strong Partition Relation on ω 1
- Definable combinatorics at the first uncountable cardinal
- A computation of 𝛿¹₅
Cited In (7)
- More definable combinatorics around the first and second uncountable cardinals
- Almost disjoint families under determinacy
- The size of the class of countable sequences of ordinals
- Definable combinatorics at the first uncountable cardinal
- Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations
- COUNTABLE LENGTH EVERYWHERE CLUB UNIFORMIZATION
- A Lipschitz determinacy principle equivalent to weak König lemma
This page was built for publication: An introduction to combinatorics of determinacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299558)
