Initial segments of computable linear orders with additional computable predicates
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- Initial segments of recursive linear orders
- On initial segments of computable linear orders
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains
- Computable linear orders and limitwise monotonic functions
- Computable linear orders and the ershov hierarchy
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- Cohesive powers of linear orders
- Codings on linear orders and algorithmic independence of natural relations
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
- Initial segments of computable linear orders with computable natural relations
- Computability on linear orderings enriched with predicates
- Punctual 1-linear orders
- A class of low linear orders having computable presentations
This page was built for publication: Initial segments of computable linear orders with additional computable predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431706)
