Pointed-perfect-set conjecture for increasing Borel approximations to Turing equivalence
Let be Borel equivalence relations on such that for every , and suppose . A pointed perfect set is a perfect set with the coding property used in the paper. Pointed-perfect-set conjecture. There is a pointed perfect set and an index such that
The conjecture would give a negative answer to the paper's question about whether Turing equivalence can be written as a nontrivial increasing union of Borel equivalence relations. No resolution is supplied.
References
Primary source
Adam Day and Andrew Marks, “On a question of Slaman and Steel”, arXiv:2004.00174 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.