Complexity of well-ordered sets in an ordered abelian group (Q6879331)

In the reviewed paper, the authors explored the complexity of classes of countable well-ordered sets by paying special attention to certain sets that arise naturally in the class of ordered abelian groups. Specifically, their work is devoted to the study of the following problem: Given an ordinal \(\alpha\) and that an arbotrary set \(A\) is well-ordered, how hard is it to say that the order type of \(A\) is at least \(\alpha\)? They succeeded to particularly answer this question in a series of (mainly technical) results, including Theorems 3.1 and 3.3 as well as Theorems 4.1, 4.2 and 4.21, respectively.