Investigating the computable Friedman-Stanley jump
Logic
2022-06-24 v1
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.
Cite
@article{arxiv.2206.11540,
title = {Investigating the computable Friedman-Stanley jump},
author = {Uri Andrews and Luca San Mauro},
journal= {arXiv preprint arXiv:2206.11540},
year = {2022}
}
Comments
24 pages