Investigating the computable Friedman-Stanley jump
Uri Andrews, Luca San Mauro · arXiv (Cornell University) · 2022
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.