Initial segments of recursive linear orders
From MaRDI portal
Recommendations
- On initial segments of computable linear orders
- Initial segments of computable linear orders with additional computable predicates
- Initial segments of computable linear orders with computable natural relations
- scientific article; zbMATH DE number 749928
- Recursive Linear Orders with Incomplete Successivities
Cited in
(8)- Weak and strong orders of linear recurring sequences
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
- Initial segments of computable linear orders with additional computable predicates
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Recursive Linear Orders with Incomplete Successivities
- On computably enumerable structures
- Graphs realised by r.e. equivalence relations
This page was built for publication: Initial segments of recursive linear orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267600)
