SearcharxivSearch

arXiv · 2202.04998

Effective powers of $\omega$ over $\Delta_2$ cohesive sets and infinite $\Pi_1$ sets without $\Delta_2$ cohesive subsets

Abstract

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals. We study cohesive powers of computable copies of $\omega$ over $\Delta_2$ cohesive sets. We show that there is a computable copy $\mathcal{L}$ of $\omega$ such that, for every $\Delta_2$ cohesive set $C$, the cohesive power of $\mathcal{L}$ over $C$ has order-type $\omega + \eta$. This improves an earlier result of Dimitrov, Harizanov, Morozov, Shafer, A. Soskova, and Vatev by generalizing from $\Sigma_1$ cohesive sets to $\Delta_2$ cohesive sets and by computing a single copy of $\omega$ that has the desired cohesive power over all $\Delta_2$ cohesive sets. Furthermore, our result is optimal in the sense that $\Delta_2$ cannot be replaced by $\Pi_2$. More generally, we show that if $X \subseteq \mathbb{N} \setminus \{0\}$ is a Boolean combination of $\Sigma_2$ sets, thought of as a set of finite order-types, then there is a computable copy $\mathcal{L}$ of $\omega$ where the cohesive power of $\mathcal{L}$ over any $\Delta_2$ cohesive set has order-type $\omega + \sigma(X \cup \{\omega + \zeta\eta + \omega^*\})$. If $X$ is finite and non-empty, then there is also a computable copy $\mathcal{L}$ of $\omega$ where the cohesive power of $\mathcal{L}$ over any $\Delta_2$ cohesive set has order-type $\omega + \sigma(X)$. An unexpected byproduct of our work is a new method for constructing infinite $\Pi_1$ sets that do not have $\Delta_2$ cohesive subsets. In fact, we construct an infinite $\Pi_1$ set that does not have a $\Delta_2$ p-cohesive subset. Infinite $\Pi_1$ sets without $\Delta_2$ r-cohesive subsets generalize D. Martin's classic co-infinite c.e. set with no maximal superset and have appeared in the work of Lerman, Shore, and Soare.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Shafer. 2022-02-10. Effective powers of $\omega$ over $\Delta_2$ cohesive sets and infinite $\Pi_1$ sets without $\Delta_2$ cohesive subsets. https://arxiv.org/abs/2202.04998

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