The study of computable structures and equivalence relations lies at the intersection of computability theory, algebra and logic, and provides essential insights into the classification and decision ...

Let $(X, \mathscr{B})$ be a standard Borel space, $R \subset X \times X$ an equivalence relation $\in \mathscr{B} \times \mathscr{B}$. Assume each equivalence class ...

I describe several ways in which forcing arguments can be used to yield clean and conceptual proofs of nonreducibility, ergodicity and other results in the theory of analytic equivalence relations. In ...