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

Given an ergodic measured discrete equivalence relation 𝓡 and an ergodic subrelation 𝒮 ⊂ 𝓡 of finite index, C. Sutherland showed that they are represented by the cross products 𝓟 ⋊αG and 𝓟 ⋊αH of ...

In this paper precomplete equivalence relations are introduced in dominical and recursion categories. After recalling definitions in $\S2$, in $\S3$ an analogue of Ersov's Fixed Point Theorem is ...