Computable linear orders and the Ershov hierarchy
From MaRDI portal
Publication:1746441
DOI10.3103/S1066369X18010085zbMATH Open1386.03052OpenAlexW2789777619WikidataQ130139915 ScholiaQ130139915MaRDI QIDQ1746441FDOQ1746441
Authors: Xianqiang Yang 
Publication date: 25 April 2018
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x18010085
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$
Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55) Total orders (06A05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursively Categorical Linear Orderings
- Recursive linear orders with recursive successivities
- Initial segments of computable linear orders with computable natural relations
- Computability on linear orderings enriched with predicates
- Linear orderings of low degree
- Degree spectra of intrinsically c. e. relations
- Δ 2 0 -copies of linear orderings
- 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
- Codings on linear orders and algorithmic independence of natural relations
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
Cited In (18)
- On Ehrenfeucht-Fraïssé equivalence of linear orderings
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- Title not available (Why is that?)
- 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)
