Initial segments of computable linear orders with computable natural relations
From MaRDI portal
Publication:308863
DOI10.3103/S1066369X16060025zbMathNoneMaRDI QIDQ308863
Publication date: 6 September 2016
Published in: Russian Mathematics (Search for Journal in Brave)
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
- Computability on linear orderings enriched with predicates
- Initial segments of computable linear orders with additional computable predicates
- Linear orderings of low degree
- Recursive linear orders with recursive successivities
- Autostability of models
- On initial segments of computable linear orders
- Scattered linear orderings with no computable presentation
- Recursively Categorical Linear Orderings
- Every Low 2 Boolean Algebra has a Recursive Copy