Computable linear orders and the Ershov hierarchy
From MaRDI portal
(Redirected from Publication:1746441)
Recommendations
- Presentations of the successor relation of computable linear ordering
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- Degree spectra of the successor relation of computable linear orderings
- Linearisations and the Ershov hierarchy
- Degree spectra of unary relations on $\langle \omega, \leq \rangle$
Cites work
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (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
- Degree spectra of intrinsically c. e. relations
- Degree spectra of the successor relation of computable linear orderings
- 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
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
- Δ 2 0 -copies of linear orderings
Cited in
(18)- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
- On Ehrenfeucht-Fraïssé equivalence of linear orderings
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- Definability of linear orders over negative equivalences
- Computable linear orders and the ershov hierarchy
- Presentations of the successor relation of computable linear ordering
- Linearisations and the Ershov hierarchy
- Degree spectra of the successor relation of computable linear orderings
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- Computably enumerable partial orders
- CODING IN GRAPHS AND LINEAR ORDERINGS
- COMPUTABLE LINEAR ORDERS AND PRODUCTS
- Linear orders realized by c.e. equivalence relations
- On the complexity of the successivity relation in computable linear orderings
- Degree spectra of unary relations on $\langle \omega, \leq \rangle$
- The complexity space of a valued linearly ordered set
- Spectral universality of linear orders with one binary relation
This page was built for publication: Computable linear orders and the Ershov hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746441)
