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

Say that a class of equivalence relations ${\cal C}$ has the finite union property if every equivalence relation that is the union of finitely many members of ${\cal C}$ must itself be a member of ...