Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a question of Slaman and Steel

Published 1 Apr 2020 in math.LO | (2004.00174v1)

Abstract: 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 infinite sequence. We show this question is deeply connected to problems surrounding Martin's conjecture, and also in countable Borel equivalence relations. In particular, if Slaman and Steel's question has a positive answer, it implies there is a universal countable Borel equivalence which is not uniformly universal, and that there is a $(\equiv_T,\equiv_m)$-invariant function which is not uniformly invariant on any pointed perfect set.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.