Recommendations
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- Degrees of orderings not isomorphic to recursive linear orderings
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Δ 2 0 -copies of linear orderings
Cited in
(25)- Linear Orders in the Pushdown Hierarchy
- Adding linear orders
- Computable presentability of countable linear orders
- Negative dense linear orders
- Shuffling of Linear Orders
- Minimum Degree Orderings
- Embedding linear orders in grids
- Initial segments of computable linear orders with computable natural relations
- Computable linear orders and the Ershov hierarchy
- Computability on linear orderings enriched with predicates
- Punctual 1-linear orders
- Low linear orderings
- Computable linear orders and limitwise monotonic functions
- Computable linear orders and the ershov hierarchy
- scientific article; zbMATH DE number 4160702 (Why is no real title available?)
- A class of low linear orders having computable presentations
- The linearity of the Mitchell order
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- The dense linear ordering principle
- Degree spectra of structures
- Scattered linear orderings with no computable presentation
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- On a computable presentation of low linear orderings
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
This page was built for publication: Linear orderings of low degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610306)
