An introduction to combinatorics of determinacy

DOI10.1090/CONM/752/15128MaRDI QIDQ3299558zbMATH OpenOpenAlexFDO

Authors

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

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

Abstract: This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.

Cites work

• scientific article; zbMATH DE number 5521857 (Why is no real title available?)
• scientific article; zbMATH DE number 3591034 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 1450237 (Why is no real title available?)
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• A New Proof of the Strong Partition Relation on ω 1
• A Nonconstructible Δ 1 3 Set of Integers
• A computation of 𝛿¹₅
• A dichotomy for the definable universe
• A trichotomy theorem in natural models of \(\text{AD}^+\)
• Cabal seminar 76-77. Proceedings, Caltech-UCLA logic seminar 1976-77
• Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Definable combinatorics at the first uncountable cardinal
• Infinitary combinatorics and the axiom of determinateness
• Ramsey ultrafilters and countable-to-one uniformization
• Set Theory
• Structural consequences of AD
• The axiom of determinacy implies dependent choices in L(R)
• \(\mathbf{L}(\mathbb{R})\) with determinacy satisfies the Suslin hypothesis

Cited in

(12)

• On \(\omega\)-strongly measurable cardinals in \(\mathbb{P}_{\max}\) extensions
• More definable combinatorics around the first and second uncountable cardinals
• Hjorth's reflection argument
• Almost disjoint families under determinacy
• Coding and anticoding of a cardinal by bounded subsets of the cardinal
• Preservation of AD via forcings
• 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
• Topological basis problem under determinacy
• 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)