Papers
Topics
Authors
Recent
Search
2000 character limit reached

Uniform Martin's conjecture, locally

Published 24 Jul 2019 in math.LO | (1907.10766v1)

Abstract: We show that part I of uniform Martin's conjecture follows from a local phenomenon, namely that if a non-constant Turing invariant function goes from the Turing degree x\boldsymbol x to the Turing degree y\boldsymbol y, then x≤Ty\boldsymbol x \le_T \boldsymbol y. Besides improving our knowledge about part I of uniform Martin's conjecture (which turns out to be equivalent to Turing determinacy), the discovery of such local phenomenon also leads to new results that did not look strictly related to Martin's conjecture before. In particular, we get that computable reducibility ≤c\le_c on equivalence relations on N\mathbb N has a very complicated structure, as ≤T\le_T is Borel reducible to it. We conclude raising the question "Is part II of uniform Martin's conjecture implied by local phenomena, too?" and briefly indicating a possible direction.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.