References
R. I. Soare, Recursively Enumerable Sets and Degrees, Persp. Math. Log., Springer, Heidelberg (1987).
M. J. Raw, “Complexity of automorphisms of recursive linear orders,” Ph.D. Thesis, Univ. Wisconsin–Madison (1995).
R. J. Coles, R. Downey, and B. Khoussainov, “On initial segments of computable linear orders,” Order, 14, No. 2, 107-124 (1998).
M. V. Zubkov, “Initial segments of computable linear orders with additional computable predicates,” Algebra and Logic, 48, No. 5, 321-329 (2009).
K. Ambos-Spies, S. B. Cooper, and S. Lempp, “Initial segments of recursive linear orders,” Order, 14, No. 2, 101-105 (1998).
Author information
Authors and Affiliations
Corresponding author
Additional information
*Supported by RFBR, project Nos. 12-01-97008 and 14.01.31158.
Translated from Algebra i Logika, Vol. 53, No. 3, pp. 413-415, May-June, 2014.
Rights and permissions
About this article
Cite this article
Bikmukhametov, R.I. Σ 02 -Initial Segments of Computable Linear Orders. Algebra Logic 53, 266–267 (2014). https://doi.org/10.1007/s10469-014-9288-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-014-9288-3