William Chan

most citedOrdinal Definability and Combinatorics of Equivalence Relations

2 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

math.LO2017

Scott Ranks of Classifications of the Admissibility Equivalence Relation

William Chan, Matthew Harrison-Trainor, Andrew Marks

Let $L$ be a recursive language. Let $S (L)$ be the set of $L$ -structures with domain $ω$ . Let $Φ :^{ω} 2 \to S (L)$ be a $Δ_{1}^{1}$ funct…

math.LO2017★ 2 cited

Ordinal Definability and Combinatorics of Equivalence Relations

William Chan

Assume $ZF + A D^{+} + V = L (P (R))$ . Let $E$ be a $Σ_{1}^{1}$ equivalence relation coded in $HOD$ . $E$ has an ordinal definable equivalence cla…

math.LO2017★ 2 cited

Definable Combinatorics of Some Borel Equivalence Relations

William Chan, Connor Meehan

If $X$ is a set, $E$ is an equivalence relation on $X$ , and $n \in ω$ , then define $$[X]^n_E = \{(x_0, ..., x_{n - 1}) \in {}^nX : (\forall i,j)(i \neq j \Rightarrow \neg(x_i \ E \…