Abstract
We give the collection of relations on computable linear orders. For any natural number n, the degree spectrum of such relations of some computable linear orders contains exactly all n-computable enumerable degrees. We also study interconnections of these relations among themselves.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Soare, R. I. Recursively Enumerable Sets and Degrees (Springer-Verlag, Berlin, 1987).
Rosenstein, J. G. Linear Orders (Acad. Press, New York, 1982).
Moses, M. “Recursive LinearOrdersWith Recursive Successivities”, Ann. Pure Appl. Logic 27, No. 3, 253–264 (1984).
Moses, M. “Recursive Properties of Isomophism Types”, Ph. D. Thesis (Monash Univ., Clayton, Victoria, Australia, 1983).
Remmel, J. B. “Recursively Categorical Linear Orders”, Proc. Amer.Math. Soc. 83, No. 2, 387–391 (1981).
Frolov, A. N. “Linear Orders of Low Degrees”, Sib.Math. J. 51, No. 5, 913–925 (2010).
Montalban, A. “Notes on the Jump of a Structure”, in Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, K. Ambos-Spies, B. Löwe, W. Merkle (Eds.), Lect. Notes in Comput. Sci. 5635 (Springer-Verlag, Berlin, 2009), 372–378.
Frolov, A. N. “Low Linear Orders”, J. Logic and Comp. 22, No. 4, 745–745 (2012).
Frolov, A. N. “Δ2 0-Copies of Linear Orders”, Algebra and Logic 45, No. 3, 201–209 (2006).
Alaev, P., Thurber, J., Frolov, A. “Computablility on Linear Orders Enriched With Predicates”, Algebra and Logic 48, No. 5, 313–320 (2009).
Frolov, A. N. “Presentations of the Successor Relation of Computable Linear Orders”, RussianMathematics 54, No. 7, 64–74 (2010).
Chubb, J., Frolov, A., Harizanov, V. “Degree Spectra of the Successor Relation of Computable Linear Orders”, Arch.Math. Logic 48, No. 1, 7–13 (2009).
Frolov, A. N. “A Note on Δ2 0-Spectra of Linear Orderings and Degree Spectra of the Successor Relation”, Russian Mathematics 57, No. 11, 65–68 (2013).
Bikmukhametov, R. I. “Initial Segments of Computable Linear Orders with Computable Natural Relations”, Russian Mathematics 60, No. 6, 12–20 (2016).
Bikmukhametov, R. I. “Σ2 0-Initial Segments of Computable Linear Orders”, Algebra and Logic 53, No. 3, 266–267 (2014).
Bikmukhametov, R. I. “Codings on Linear Orders and Algorithmic Independence of Natural Relations”, Lobachevskii J.Math. 35, No. 4, 326–331 (2014).
Bikmukhametov, R. I. “Algorithmic Independence of Natural Relations on Computable Linear Orders”, Uchen. Zap. Kazansk. Univ. Ser. Fiz.-Mat. Nauki 155, No. 3, 80–90 (2013) [in Russian].
Hirschfeldt, D. R. “Degree Spectra of Intrinsically C. E. Relations”, J. Symbolic Logic 66, No. 2, 441–469 (2001).
Feiner, L. J. “Orders and Boolean algebras not isomorphic to recursive ones”, Ph. D. Thesis (MIT, Cambridge,MA, 1967).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Ya.A. Mikhailovskaya, A.N. Frolov, 2018, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2018, No. 1, pp. 67–74.
About this article
Cite this article
Mikhailovskaya, Y.A., Frolov, A.N. Computable Linear Orders and the Ershov Hierarchy. Russ Math. 62, 58–64 (2018). https://doi.org/10.3103/S1066369X18010085
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X18010085