Pages that link to "Item:Q3712322"
From MaRDI portal
The following pages link to Relations Intrinsically Recursive in Linear Orders (Q3712322):
Displaying 13 items.
- Recursive linear orders with recursive successivities (Q1062051) (← links)
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations (Q1106203) (← links)
- Structures computable in polynomial time. II (Q1644852) (← links)
- Computable linear orders and the ershov hierarchy (Q2112325) (← links)
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders (Q2172889) (← links)
- The intrinsic enumerability of linear orders (Q2714036) (← links)
- Computability of Fraïssé limits (Q3083128) (← links)
- ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355) (← links)
- Degree spectra of relations on computable structures in the presence of Δ<sub>2</sub><sup>0</sup>isomorphisms (Q3149990) (← links)
- Recursive Linear Orders with Incomplete Successivities (Q3977226) (← links)
- Degree Spectra of Relations on Computable Structures (Q4508282) (← links)
- (Q4783327) (← links)
- The Complexity of intrinsically r.e. subsets of existentially decidable models (Q5753943) (← links)