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

TL;DR
This paper investigates the structure of cohesive powers of computable copies of over cohesive sets, generalizing previous results and introducing new methods for constructing sets without cohesive subsets.
Contribution
It extends the understanding of cohesive powers over cohesive sets, providing a computable copy of with specific order-types and developing a new method for constructing sets without cohesive subsets.
Findings
Existence of a computable with cohesive powers of order-type + over all cohesive sets.
Generalization of results from to sets defined by Boolean combinations of sets.
Development of a new construction method for infinite sets lacking 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 .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory
