Pages that link to "Item:Q308863"
From MaRDI portal
The following pages link to Initial segments of computable linear orders with computable natural relations (Q308863):
Displaying 7 items.
- Initial segments of computable linear orders with additional computable predicates (Q431706) (← links)
- Initial segments of recursive linear orders (Q1267600) (← links)
- On initial segments of computable linear orders (Q1267602) (← 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)