Pages that link to "Item:Q1746441"
From MaRDI portal
The following pages link to Computable linear orders and the Ershov hierarchy (Q1746441):
Displaying 13 items.
- Definability of linear orders over negative equivalences (Q321260) (← links)
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy (Q542199) (← links)
- Presentations of the successor relation of computable linear ordering (Q619461) (← links)
- Degree spectra of the successor relation of computable linear orderings (Q1005920) (← links)
- Computable linear orders and the ershov hierarchy (Q2112325) (← links)
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders (Q2172889) (← links)
- The complexity space of a valued linearly ordered set (Q2843630) (← links)
- LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS (Q3188324) (← links)
- On Ehrenfeucht-Fraïssé equivalence of linear orderings (Q3483267) (← links)
- (Q4249724) (← links)
- COMPUTABLE LINEAR ORDERS AND PRODUCTS (Q5148100) (← links)
- CODING IN GRAPHS AND LINEAR ORDERINGS (Q5148104) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
