Showing math.LOShow all
2 papers · 1 filter
math.LO2026
On a question of Slaman and Steel
Adam Day, Andrew Marks
We consider an old question of Slaman and Steel: whether Turing equivalence is an increasing union of Borel equivalence relations none of which contain a uniformly computable infin…
math.LO2024
Hausdorff dimension and countable Borel equivalence relations
Andrew Marks, Dino Rossegger, Theodore Slaman
We show that if is a countable Borel equivalence relation on , then there is a closed subset of Hausdorff dimension so that $E \restrictio…