Effective powers of ω over 2 cohesive sets and infinite 1 sets without 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 2 cohesive sets. We show that there is a computable copy L of ω such that, for every 2 cohesive set C, the cohesive power of L over C has order-type ω + η. This improves an earlier result of Dimitrov, Harizanov, Morozov, Shafer, A. Soskova, and Vatev by generalizing from 1 cohesive sets to 2 cohesive sets and by computing a single copy of ω that has the desired cohesive power over all 2 cohesive sets. Furthermore, our result is optimal in the sense that 2 cannot be replaced by 2. More generally, we show that if X ⊂eq N \0\ is a Boolean combination of 2 sets, thought of as a set of finite order-types, then there is a computable copy L of ω where the cohesive power of L over any 2 cohesive set has order-type ω + σ(X \ω + ζη + ω*\). If X is finite and non-empty, then there is also a computable copy L of ω where the cohesive power of L over any 2 cohesive set has order-type ω + σ(X). An unexpected byproduct of our work is a new method for constructing infinite 1 sets that do not have 2 cohesive subsets. In fact, we construct an infinite 1 set that does not have a 2 p-cohesive subset. Infinite 1 sets without 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.