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

Equivalences and translations between consequence relations abound in logic. The notion of equivalence can be defined syntactically, in terms of translations of formulas, and order-theoretically, in ...