Computable linear orders and the Ershov hierarchy
From MaRDI portal
Publication:1746441
DOI10.3103/S1066369X18010085zbMath1386.03052OpenAlexW2789777619WikidataQ130139915 ScholiaQ130139915MaRDI QIDQ1746441
Publication date: 25 April 2018
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x18010085
Total orders (06A05) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)
Related Items (2)
Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Computable linear orders and the ershov hierarchy
Cites Work
- Unnamed Item
- Unnamed Item
- Initial segments of computable linear orders with computable natural relations
- Computability on linear orderings enriched with predicates
- Linear orderings of low degree
- Presentations of the successor relation of computable linear ordering
- Degree spectra of the successor relation of computable linear orderings
- Recursive linear orders with recursive successivities
- Codings on linear orders and algorithmic independence of natural relations
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- Degree spectra of intrinsically c.e. relations
- Low linear orderings
- Notes on the Jump of a Structure
- Recursively Categorical Linear Orderings
- Δ 2 0 -copies of linear orderings
This page was built for publication: Computable linear orders and the Ershov hierarchy
