Computable reducibility of equivalence relations and an effective jump operator

This post is a link to https://arxiv.org/abs/2005.13777

With John Clemens and Gianni Krakoff. Journal of symbolic logic 88(2):540–561.

Abstract: We introduce the computable FS-jump, an analog of the classical Friedman–Stanley jump in the context of equivalence relations on $\mathbb N$. We prove that the computable FS-jump is proper with respect to computable reducibility. We then study the effect of the computable FS-jump on computably enumerable equivalence relations (ceers).