On cohesive powers of linear orders
Rumen Dimitrov, Valentina Harizanov, Andrey Morozov, Paul Shafer,, Alexandra A. Soskova, Stefan V. Vatev

TL;DR
This paper explores the properties of cohesive powers of computable linear orders, especially copies of ω, revealing how their order-types can vary and depend on the structure of the computable copy.
Contribution
It characterizes the possible order-types of cohesive powers of computable copies of ω, including new constructions with diverse order-types based on Boolean combinations of Σ₂ sets.
Findings
Cohesive powers of standard ω have order-type ω + ζη.
Non-standard computable copies of ω can have cohesive powers with order-type ω + η.
The order-type of cohesive powers can be manipulated using Boolean combinations of Σ₂ sets.
Abstract
Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let , , and denote the respective order-types of the natural numbers, the integers, and the rationals when thought of as linear orders. We investigate the cohesive powers of computable linear orders, with special emphasis on computable copies of . If is a computable copy of that is computably isomorphic to the usual presentation of , then every cohesive power of has order-type . However, there are computable copies of , necessarily not computably isomorphic to the usual presentation, having cohesive powers not elementarily equivalent to . For example, we show that there is a computable copy of with a cohesive power of order-type…
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
