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

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

Equivalence‐based instruction (EBI) is an instructional methodology grounded in the principles of stimulus equivalence, whereby teaching a limited set of direct relations gives rise to the emergence ...

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