Computable reducibility of equivalence relations
An undergraduate project by Archie Worth, Summer 2025
Abstract: We review the computable analog of Borel reducibility of equivalence relations. We then study two “jump operations” from Borel reducibility theory: the Friedman–Stanley jump and the Z-jump. We establish the analogue of the Z-jump in the computable context, calculate some examples, and establish its basic properties.