Abstract
In this paper we construct a low2 scattered linear orderings with no computable presentation. This is a negative answer for the question of A. Kach and A. Montalbán.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. E. Alaev, A. N. Frolov, and J. Thurber, Algebra and Logic 5(48), 313–320 (2009).
A. Kach and A. Montalbán, Order 28, 593–600 (2011).
C. G. Jockusch and R. I. Soare, Annales of Pure and Applied Logic 52, 39–61 (1991).
R. G. Downey and M. F. Moses, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 35, 237–246 (1989).
R. G. Downey, Computability theory and linear orders In: Ershov Yu. L., Goncharov S. S., Nerode A., Remmel J. B. (eds.) Handbook of RecursiveMathematics, (V. 138 of Studies in Logic and the Foundations of Mathematics, chapter 14. Elsevier, 1998).
M. Lerman, Proc. Seminars and Conf. Math. Logic (Univ. Connecticut, Storrs, Conn., 1979/80, Springer, Berlin, 1981).
A. N. Frolov, Algebra and Logic 45(3), 201–209 (2006).
A. N. Frolov, SiberianMathematical Journal 5(51), 913–925 (2010).
A. N. Frolov, Journal of Logic and Computation 22(4), 745–754 (2012).
R. I. Soare, Recursively enumerable sets and degrees (Heidelberg: Springer-Verlag, 1987).
J. G. Rosenstein, Linear orderings, (Academic Press, New York, 1982).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by M. M. Arslanov
Rights and permissions
About this article
Cite this article
Frolov, A.N. Scattered linear orderings with no computable presentation. Lobachevskii J Math 35, 19–22 (2014). https://doi.org/10.1134/S199508021401003X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S199508021401003X