The following pages link to Δ 2 0 -copies of linear orderings (Q5294715):
Displaying 22 items.
- Computability on linear orderings enriched with predicates (Q431704) (← links)
- Linear orderings of low degree (Q610306) (← links)
- On a computable presentation of low linear orderings (Q669557) (← links)
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains (Q1673673) (← links)
- Computable linear orders and the Ershov hierarchy (Q1746441) (← links)
- Ranges of \(\eta \)-functions of \(\eta \)-like linear orderings (Q1759257) (← links)
- Coding and definability in computable structures (Q1782235) (← 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)
- Punctual copies of algebraic structures (Q2186304) (← 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)
- COMPUTABLE LINEAR ORDERS AND PRODUCTS (Q5148100) (← links)
- Effective categoricity of computable linear orderings (Q5965136) (← 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)
