We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discrete ordering of low degree has a computable representation, and study estimates for the complexity of all isomorphisms constructed in the article.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Jockusch C. G. and Soare R. I., “Degrees of orderings not isomorphic to recursive linear orderings,” Ann. Pure Appl. Logic, 52, 39–61 (1991).
Downey R. G. and Jockusch C. G., “Every low Boolean algebra is isomorphic to a recursive one,” Proc. Amer. Math. Soc., 122, No. 3, 871–880 (1994).
Downey R. G. and Moses M. F., “On choice sets and strongly nontrivial self-embeddings of recursive linear orderings,” Z. Math. Logik Grundlag. Math., 35, 237–246 (1989).
Downey R. G., “Computability theory and linear orderings,” in: ed]Ershov_Yu. L., Goncharov S. S., Nerode A., Remmel J. B. (eds.), Handbook of Recursive Mathematics, Elsevier, Amsterdam, 1998. Ch. 14 (Stud. Logic Found. Math.; V. 139).
Frolov A. S., “▵0 2-Copies of linear orderings,” Algebra and Logic, 45, No. 3, 201–209 (2006).
Soare R. I., Recursively Enumerable Sets and Degrees, Springer-Verlag, Heidelberg (1987).
Rosenstein J. G., Linear Orderings, Academic Press, New York (1982).
Original Russian Text Copyright Sc 2010 Frolov A. N.
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 51, No. 5, pp. 1147–1162, September–October, 2010
About this article
Cite this article
Frolov, A.N. Linear Orderings of Low Degree. Sib Math J 51, 913–925 (2010). https://doi.org/10.1007/s11202-010-0091-7
- linear ordering
- order type
- computable representation
- low degree