SearcharxivSearch

arXiv · 2412.01071

A Relation on ${(\omega, <)}$ of Intermediate Degree Spectrum on a Cone

Abstract

We examine the degree spectra of relations on ${(\omega, <)}$. Given an additional relation $R$ on ${(\omega,<)}$, such as the successor relation, the degree spectrum of $R$ is the set of Turing degrees of $R$ in computable copies of ${(\omega,<)}$. It is known that all degree spectra of relations on ${(\omega,<)}$ fall into one of four categories: the computable degree, all of the c.e. degrees, all of the $\Delta^0_2$ degrees, or intermediate between the c.e. degrees and the $\Delta^0_2$ degrees. Examples of the first three degree spectra are easy to construct and well-known, but until recently it was open whether there is a relation with intermediate degree spectrum on a cone. Bazhenov, Kaloci\'{n}ski, and Wroclawski constructed an example of an intermediate degree spectrum, but their example is unnatural in the sense that it is constructed by diagonalization and thus not canonical, that is, which relation you obtain from their construction depends on which G\"odel encoding (and hence order of enumeration) of the partial computable functions / programs you choose. In this paper, we use the ''on-a-cone'' paradigm to restrict our attention to "natural" relations $R$. Our main result is a construction of a natural relation on ${(\omega,<)}$ which has intermediate degree spectrum. This relation has intermediate degree spectrum because of structural reasons.

Explore related subjects

Keep this discovery

BibTeXRIS

Jad Damaj, Matthew Harrison-Trainor. 2024-12-02. A Relation on ${(\omega, <)}$ of Intermediate Degree Spectrum on a Cone. https://arxiv.org/abs/2412.01071

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

KEEP EXPLORING

Related papers

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

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

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