• Corpus ID: 119329887

Definable Combinatorics of Some Borel Equivalence Relations

@article{Chan2017DefinableCO,
  title={Definable Combinatorics of Some Borel Equivalence Relations},
  author={William Chan and C. G. W. Meehan},
  journal={arXiv: Logic},
  year={2017}
}
If $X$ is a set, $E$ is an equivalence relation on $X$, and $n \in \omega$, then define $$[X]^n_E = \{(x_0, ..., x_{n - 1}) \in {}^nX : (\forall i,j)(i \neq j \Rightarrow \neg(x_i \ E \ x_j))\}.$$ For $n \in \omega$, a set $X$ has the $n$-Jonsson property if and only if for every function $f : [X]^n_= \rightarrow X$, there exists some $Y \subseteq X$ with $X$ and $Y$ in bijection so that $f[[Y]^n_=] \neq X$. A set $X$ has the Jonsson property if and only for every function $f : (\bigcup_{n \in… 
Definable Combinatorics of Graphs and Equivalence Relations
Let D = (X, D) be a Borel directed graph on a standard Borel space X and let χB(D) be its Borel chromatic number. If F0, …, Fn-1: X → X are Borel functions, let DF0, …, Fn-1 be the directed graph
MORE DEFINABLE COMBINATORICS AROUND THE FIRST AND SECOND UNCOUNTABLE CARDINAL
Assume ZF+AD. The following two continuity results for functions on certain subsets of P(ω1) and P(ω2) will be shown: For every < ω1 and function Φ : [ω1] → ω1, there is a club C ⊆ ω1 and a ζ < so
Ordinal definability and combinatorics of equivalence relations
TLDR
ZF + AD proves that the ordinal definable equivalence class of E-class section uniformization is J\'onsson whenever $\kappa$ is an ordinal.
Definable combinatorics at the first uncountable cardinal
We work throughout in the theory ZF with the axiom of determinacy, AD. We introduce and prove some club uniformization principles under AD and ADR. Using these principles, we establish continuity

References

SHOWING 1-10 OF 15 REFERENCES
A partition theorem for perfect sets
Let P be a perfect subset of the real line, and let the «-element subsets of P be partitioned into finitely many classes, each open (or just Borel) in the natural topology on the collection of such
Recent developments in the theory of Borel reducibility
Let E_0 be the Vitali equivalence relation and E_3 the product of countably many copies of E_0. Two new dichotomy theorems for Borel equivalence relations are proved. First, for any Borel
Actions by the classical Banach spaces
  • G. Hjorth
  • Mathematics
    Journal of Symbolic Logic
  • 2000
TLDR
This paper considers a third category formed by the continuous actions of separable Banach spaces on Polish spaces, which cannot be subsumed under the two earlier headings and concerns the complexity of these equivalence relations.
Equivalence Relations, Projective and Beyond
The classification of hypersmooth Borel equivalence relations
This paper is a contribution to the study of Borel equivalence relations in standard Borel spaces, i.e., Polish spaces equipped with their Borel structure. A class of such equivalence relations which
The Axiom of Determinancy Implies Dependent Choices in L(R)
TLDR
It is finally shown that ZF+AD+¬DC_R, where DC_R is DC restricted to reals, implies the consistency of ZF-AD+DC, in fact implies R^# (i.e. the sharp of L(R)) exists.
Infinitary Combinatorics And The Axiom Of Determinateness
Thank you for reading infinitary combinatorics and the axiom of determinateness. Maybe you have knowledge that, people have search hundreds times for their favorite books like this infinitary
DETERMINACY AND JÓNSSON CARDINALS IN L(R)
Assume ZF + AD + V = L(R) and let κ < Θ be an uncountable cardinal. We show that κ is Jónsson, and that if cof(κ) = ω then κ is Rowbottom. We also establish some other partition properties. §
The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal
TLDR
The second edition of a well-established monograph on the identification of a canonical model in which the Continuum Hypothesis is false is updated to take into account some of the developments in the decade since the first edition appeared.
...
...