Initial segments of computable linear orders with computable natural relations
From MaRDI portal
Recommendations
- On initial segments of computable linear orders
- Initial segments of computable linear orders with additional computable predicates
- Codings on linear orders and algorithmic independence of natural relations
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- Relative complexity for computable presentations of the conventional linear order on the set of naturals
Cites work
- Autostability of models
- Computability on linear orderings enriched with predicates
- Every Low 2 Boolean Algebra has a Recursive Copy
- Initial segments of computable linear orders with additional computable predicates
- Linear orderings of low degree
- On initial segments of computable linear orders
- Recursive linear orders with recursive successivities
- Recursively Categorical Linear Orderings
- Scattered linear orderings with no computable presentation
Cited in
(6)- Relative complexity for computable presentations of the conventional linear order on the set of naturals
- Computable linear orders and the Ershov hierarchy
- Initial segments of computable linear orders with additional computable predicates
- Computable linear orders and the ershov hierarchy
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- The block relation in computable linear orders
This page was built for publication: Initial segments of computable linear orders with computable natural relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q308863)
