This article is cited in 22 papers

Linear orderings of low degree

A. N. Frolov

Kazan State University, Kazan, Russia

Abstract: 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.

Keywords: linear ordering, order type, computable representation, low degree, complexity.

UDC: 510.53+512.562

Received: 14.04.2009

 English version: Siberian Mathematical Journal, 2010, 51:5, 913–925

Bibliographic databases:

• 
• 
•