SearcharxivSearch

arXiv · 2308.12102

A $\Pi^0_2$ Singleton of Minimal Arithmetic Degree

Abstract

In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, ($\leq_{a}$) the $\omega$-REA sets play a role analogous to the role the r.e. degrees play in the study of the Turing degrees. However, much less is known about the arithmetic degrees and the role of the $\omega$-REA sets in that structure than about the Turing degrees. Indeed, even basic questions such as the existence of a $\omega$-REA set of minimal arithmetic degree are open. This paper makes progress on this question by demonstrating that some promising approaches inspired by the analogy with the r.e sets fail to show that no $\omega$-REA set is arithmetically minimal. Finally, it constructs a $\Pi^0_2$ singleton of minimal arithmetic degree. Not only is this a result of considerable interest in it's own right, constructions of $\Pi^0_2$ singletons often pave the way for constructions of $\omega$-REA sets with similar properties. Along the way, a number of interesting results relating arithmetic reducibility and rates of growth are established.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Gerdes. 2023-08-23. A $\Pi^0_2$ Singleton of Minimal Arithmetic Degree. https://arxiv.org/abs/2308.12102

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