No label defined (Q4249724)

The aim of the paper under review is to give a survey of results and techniques in the computability theory of linear orderings. In particular the following topics are included and discussed: the analysis of the notion of presentation of a structure (ordering), how computable properties may partition classical isomorphism types of computable orderings, the infinite injury priority method and the fundamental results of Watnick and Lerman, the effective content of various classical theorems, concentrating on embeddings and automorphisms, linear extensions of computable partial orderings, degree-theoretical aspects of presentations. In the final section other areas of computable combinatorics and other areas of computable aspects of linear orderings are briefly discussed. The paper contains also some new results, unpublished results and new proofs of old results, as well as numerous open questions. For the entire collection see [Zbl 0905.03002].