1 citations · 2 across the 7 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2024
Analogues of the countable Borel equivalence relations in the setting of computable reducibility
Uri Andrews, Luca San Mauro
Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence r…
math.LO2022★ 1 cited
Investigating the computable Friedman-Stanley jump
Uri Andrews, Luca San Mauro
We answer several questions about the computable Friedman-Stanley jump on equivalence relations. This jump, introduced by Clemens, Coskey, and Krakoff, deepens the natural connecti…