Martin's Conjecture in the Enumeration Degrees
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908637412196352 |
|---|---|
| author | Cordero, Antonio Nakid |
| author_facet | Cordero, Antonio Nakid |
| contents | Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the class of uniformly invariant functions and a long-standing conjecture by Steel is that every definable function on the Turing degrees is equivalent to a uniformly invariant one. We explore whether a similar classification is possible in the enumeration degrees, an extension of the Turing degrees. We show that the spectrum of behavior is much wider in the enumeration degrees, even for uniformly invariant functions. However, our main result is that uniformly invariant functions behave locally as nicely as possible: they are constant, increasing, or above the skip operator. As a consequence, we show that there is a definable function in the enumeration degrees that is not equivalent to a uniformly invariant one on any cone. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_19147 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Martin's Conjecture in the Enumeration Degrees Cordero, Antonio Nakid Logic 03D30, 03D28 Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the class of uniformly invariant functions and a long-standing conjecture by Steel is that every definable function on the Turing degrees is equivalent to a uniformly invariant one. We explore whether a similar classification is possible in the enumeration degrees, an extension of the Turing degrees. We show that the spectrum of behavior is much wider in the enumeration degrees, even for uniformly invariant functions. However, our main result is that uniformly invariant functions behave locally as nicely as possible: they are constant, increasing, or above the skip operator. As a consequence, we show that there is a definable function in the enumeration degrees that is not equivalent to a uniformly invariant one on any cone. |
| title | Martin's Conjecture in the Enumeration Degrees |
| topic | Logic 03D30, 03D28 |
| url | https://arxiv.org/abs/2510.19147 |