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 ...

Let $R$ be a Borel equivalence relation with countable equivalence classes, on the standard Borel space $(X, \mathscr{A}, \mu)$. Let $\sigma$ be a 2-cohomology class ...