Cohesive Powers of Linear Orders

Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers \(\varPi _{C} \mathcal {L}\) for familiar computable linear orders \(\mathcal {L}\). If \( \mathcal {L}\) is isomorphic to the ordered set of natural numbers \(\mathbb {N}\) and has a computable successor function, then \(\varPi _{C}\mathcal {L}\) is isomorphic to \(\mathbb {N}+\mathbb {Q}\times \mathbb {Z}\). Here, \(+\) stands for the sum and \(\times \) for the lexicographical product of two orders. We construct computable linear orders \(\mathcal {L}_{1}\) and \(\mathcal {L}_{2}\) isomorphic to \(\mathbb {N},\) both with noncomputable successor functions, such that \(\varPi _{C}\mathcal {L}_{1}\mathbb {\ }\)is isomorphic to \(\mathbb {N}+\mathbb {Q}\times \mathbb {Z}\), while \(\varPi _{C}\mathcal {L}_{2}\) is not. While cohesive powers preserve the satisfiability of all \(\mathrm {\Pi }_{2}^{0}\) and \(\mathrm {\Sigma } _{2}^{0}\) sentences, we provide new examples of \(\mathrm {\Pi }_{3}^{0}\) sentences \(\varPhi \) and computable structures \(\mathcal {M}\) such that \(\mathcal {M}\vDash \varPhi \) while \(\varPi _{C}\mathcal {M} \vDash \urcorner \varPhi \).