Pages that link to "Item:Q2263111"
From MaRDI portal
The following pages link to Codings on linear orders and algorithmic independence of natural relations (Q2263111):
Displaying 8 items.
- Initial segments of computable linear orders with computable natural relations (Q308863) (← links)
- Cuts of linear orders (Q651418) (← links)
- A coding of the countable linear orderings (Q803179) (← links)
- Computable linear orders and the Ershov hierarchy (Q1746441) (← links)
- Relative complexity for computable presentations of the conventional linear order on the set of naturals (Q1876412) (← links)
- Computable linear orders and the ershov hierarchy (Q2112325) (← links)
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders (Q2172889) (← links)
- CODING IN GRAPHS AND LINEAR ORDERINGS (Q5148104) (← links)