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 , , and denote the respective order-types of the natural numbers, the integers, and the rationals. We study cohesive powers of computable copies of over cohesive sets. We show that there is a computable copy of such that, for every cohesive set , the cohesive power of over has order-type . This improves an earlier result of Dimitrov, Harizanov, Morozov, Shafer, A. Soskova, and Vatev by generalizing from cohesive sets to cohesive sets and by computing a single copy of that has the desired cohesive power over all cohesive sets. Furthermore, our result is optimal in the sense that cannot be replaced by . More generally, we show that if is a Boolean combination of sets, thought of as a set of finite order-types, then there is a computable copy of where the cohesive power of over any cohesive set has order-type . If is finite and non-empty, then there is also a computable copy of where the cohesive power of over any cohesive set has order-type . An unexpected byproduct of our work is a new method for constructing infinite sets that do not have cohesive subsets. In fact, we construct an infinite set that does not have a p-cohesive subset. Infinite sets without 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.
Keywords
Cite
@article{arxiv.2202.04998,
title = {Effective powers of $\omega$ over $\Delta_2$ cohesive sets and infinite $\Pi_1$ sets without $\Delta_2$ cohesive subsets},
author = {Paul Shafer},
journal= {arXiv preprint arXiv:2202.04998},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2009.00340