The following pages link to Low linear orderings (Q2907053):
Displayed 16 items.
- On a computable presentation of low linear orderings (Q669557) (← links)
- Computable linear orders and the Ershov hierarchy (Q1746441) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
- Computable linear orders and the ershov hierarchy (Q2112325) (← links)
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders (Q2172889) (← links)
- Scattered linear orderings with no computable presentation (Q2263069) (← links)
- Codings on linear orders and algorithmic independence of natural relations (Q2263111) (← links)
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation (Q2439398) (← links)
- Rice sequences of relations (Q2941599) (← links)
- Automorphisms of<i>η</i>-like computable linear orderings and Kierstead's conjecture (Q2958211) (← links)
- On limitwise monotonicity and maximal block functions (Q3195647) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)