The following pages link to Linear orderings of low degree (Q610306):
Displaying 24 items.
- Initial segments of computable linear orders with computable natural relations (Q308863) (← links)
- Computability on linear orderings enriched with predicates (Q431704) (← links)
- On a computable presentation of low linear orderings (Q669557) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains (Q1673673) (← links)
- Negative dense linear orders (Q1745085) (← 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)
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
- Embedding linear orders in grids (Q2491206) (← links)
- Adding linear orders (Q2892687) (← links)
- Low linear orderings (Q2907053) (← links)
- Linear Orders in the Pushdown Hierarchy (Q3587429) (← links)
- The dense linear ordering principle (Q4358048) (← links)
- The linearity of the Mitchell order (Q4565758) (← links)
- Shuffling of Linear Orders (Q4846671) (← links)
- Minimum Degree Orderings (Q5387742) (← links)
- Punctual 1-linear orders (Q6059288) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)
