Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
From MaRDI portal
Publication:2172889
DOI10.1134/S1995080222060221zbMath1496.03173OpenAlexW4285504650MaRDI QIDQ2172889
Publication date: 19 September 2022
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080222060221
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: Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
