Investigating the computable Friedman-Stanley jump

Abstract

We answer several questions about the computable Friedman-Stanley jump on equivalence relations. This jump, introduced by Clemens, Coskey, and Krakoff, deepens the natural connection between the study of computable reduction and its Borel analog studied deeply in descriptive set theory.

arXiv comment24 pages