On initial segments of computable linear orders
From MaRDI portal
It is shown that there is a computable linear order that has an initial segment \({\mathcal A}\) such that \({\mathcal A}\) is \(\Pi^0_2\), is isomorphic to the set of rational numbers with the usual ordering, and has the key property that it is not isomorphic to a computable linear order. This stands in contrast with a recent result of Ambos-Spies, Cooper, and Lempp that states that every \(\Sigma_2^0\) initial segment of a computable linear order is isomorphic to a computable linear order.
Recommendations
Cited in
(19)- Linear orders with distinguished function symbol
- Initial segments of recursive linear orders
- Computable linear orders and limitwise monotonic functions
- Computable presentability of countable linear orders
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
- Order-computable sets
- Prime models of theories of computable linear orderings
- Limitwise monotonic sequences and degree spectra of structures
- Iterated effective embeddings of abelian p-groups
- Initial segments of computable linear orders with computable natural relations
- On limitwise monotonicity and maximal block functions
- Initial segments of computable linear orders with additional computable predicates
- Computable choice functions for computable linear orderings
- A characterization of the strongly -representable many-one degrees
- Limitwise monotonic functions, sets, and degrees on computable domains
- A class of low linear orders having computable presentations
- Rogers semilattices of limitwise monotonic numberings
- The complexity of the successor and the block relations on computable linear orders
- Computable shuffle sums of ordinals
This page was built for publication: On initial segments of computable linear orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267602)
