Computable linear orders and the ershov hierarchy
From MaRDI portal
Publication:2112325
DOI10.3103/S1066369X22010066OpenAlexW4312326170MaRDI QIDQ2112325
Publication date: 10 January 2023
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x22010066
computable linear ordersdegree spectrum of relations\(n\)-computable enumerable (\(n\)-c.e.) degrees
Cites Work
- Unnamed Item
- Initial segments of computable linear orders with computable natural relations
- Computability on linear orderings enriched with predicates
- Initial segments of computable linear orders with additional computable 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
- Computable linear orders and the Ershov hierarchy
- Computable presentability of countable linear orders
- Scattered linear orderings with no computable presentation
- 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
- Computable Boolean algebras
- Degree spectra of intrinsically c.e. relations
- Low linear orderings
- Notes on the Jump of a Structure
- Relations Intrinsically Recursive in Linear Orders
- Recursively Categorical Linear Orderings
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Every Low 2 Boolean Algebra has a Recursive Copy
- Δ 2 0 -copies of linear orderings
This page was built for publication: Computable linear orders and the ershov hierarchy
