Low linear orderings
From MaRDI portal
Recommendations
Cited in
(26)- Computable linear orders and the Ershov hierarchy
- Computable linear orders and limitwise monotonic functions
- Degree spectra of structures
- Computable presentability of countable linear orders
- Computable linear orders and the ershov hierarchy
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- Scattered linear orderings with no computable presentation
- Codings on linear orders and algorithmic independence of natural relations
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- Rice sequences of relations
- Automorphisms of -like computable linear orderings and Kierstead's conjecture
- On limitwise monotonicity and maximal block functions
- Linear Order Types of Nonrecursive Presentability
- Computability on linear orderings enriched with predicates
- The dense linear ordering principle
- scientific article; zbMATH DE number 1873432 (Why is no real title available?)
- Shuffling of Linear Orders
- On maximal block functions of computable \(\eta \)-like linear orderings
- A class of low linear orders having computable presentations
- Linear orderings of low degree
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
- On a computable presentation of low linear orderings
- Low scattered linear orders
- The coding theorems for linear orders
- A low scattered linear order of rank 2 without computable copy
This page was built for publication: Low linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907053)
