Codings on linear orders and algorithmic independence of natural relations
From MaRDI portal
Publication:2263111
DOI10.1134/S1995080214040131zbMath1325.03052MaRDI QIDQ2263111
Publication date: 17 March 2015
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
codinglinear orderblock relationdensity relationleft limit relationright limit relationcomputable presentationneighborhood relationalgorithmic independence
Related Items
Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Computable linear orders and the Ershov hierarchy ⋮ Computable linear orders and the ershov hierarchy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computability on linear orderings enriched with predicates
- Initial segments of computable linear orders with additional computable predicates
- Recursive linear orders with recursive successivities
- Low linear orderings
- ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- Recursively Categorical Linear Orderings
- Every Low 2 Boolean Algebra has a Recursive Copy
- Δ 2 0 -copies of linear orderings
