Algorithmic relationships of relations S_L^n on linear orders
From MaRDI portal
Publication:2172889
DOI10.1134/S1995080222060221zbMATH Open1496.03173OpenAlexW4285504650MaRDI QIDQ2172889FDOQ2172889
Authors: Ya. A. Mikhailovskaya 
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
Recommendations
- Codings on linear orders and algorithmic independence of natural relations
- Initial segments of computable linear orders with computable natural relations
- Computable linear orders and the Ershov hierarchy
- Presentations of the successor relation of computable linear ordering
- On the complexity of the successivity relation in computable linear orderings
Cites Work
- Recursively Categorical Linear Orderings
- Recursive linear orders with recursive successivities
- Scattered linear orderings with no computable presentation
- 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
- Every Low 2 Boolean Algebra has a Recursive Copy
- Linear orderings of low degree
- Degree spectra of intrinsically c. e. relations
- Computable Boolean algebras
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Δ 2 0 -copies of linear orderings
- Computable linear orders and the Ershov hierarchy
- Degree spectra of the successor relation of computable linear orderings
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- Presentations of the successor relation of computable linear ordering
- Notes on the Jump of a Structure
- Low linear orderings
- Computable presentability of countable linear orders
- Codings on linear orders and algorithmic independence of natural relations
- Title not available (Why is that?)
- Relations Intrinsically Recursive in Linear Orders
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
Cited In (3)
This page was built for publication: Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172889)
