Algorithmic relationships of relations S_L^n on linear orders
From MaRDI portal
Publication:2172889
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
- scientific article; zbMATH DE number 3869317 (Why is no real title available?)
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- Codings on linear orders and algorithmic independence of natural relations
- Computability on linear orderings enriched with predicates
- Computable Boolean algebras
- Computable linear orders and the Ershov hierarchy
- Computable presentability of countable linear orders
- Degree spectra of intrinsically c. e. relations
- Degree spectra of the successor relation of computable linear orderings
- Every Low 2 Boolean Algebra has a Recursive Copy
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Initial segments of computable linear orders with additional computable predicates
- Initial segments of computable linear orders with computable natural relations
- Linear orderings of low degree
- Low linear orderings
- Notes on the Jump of a Structure
- Presentations of the successor relation of computable linear ordering
- Recursive linear orders with recursive successivities
- Recursively Categorical Linear Orderings
- Relations Intrinsically Recursive in Linear Orders
- Scattered linear orderings with no computable presentation
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
- Δ 2 0 -copies of linear orderings
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)