Martin's Conjecture in the Enumeration Degrees

Antonio Nakid Cordero

Home/Archive/arXiv

arXiv · 2510.19147

Martin's Conjecture in the Enumeration Degrees

Antonio Nakid Cordero

View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Antonio Nakid Cordero. 2025-10-22. Martin's Conjecture in the Enumeration Degrees. https://arxiv.org/abs/2510.19147

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗