Labelling systems and r.e. structures (Q923076)

In Ann. Pure Appl. Logic 32, 113-155 (1986; Zbl 0631.03016), the author introduced a formal framework for the development of inductive \(\underset{\tilde{}} 0^{(\alpha)}\)-priority arguments \((\alpha <\omega_ 1^{ck})\). This paper contained the first metatheorem for such arguments, and formalized the earlier `method of workers' of Harrington and even earlier specific constructions such as \textit{L. Feiner}'s in J. Symb. Logic 35, 365-374 (1970; Zbl 0222.02048). Since then the author and his students have refined and recast his metatheorem in a series of papers. In the one under review, he presents labelling systems which are appropriate for construction of r.e. (rather than only recursive) structures. Some applications (such as those in the lines of the paper reviewed above (see Zbl 0712.03020)) are discussed. The reader should also consult the author's recent game theoretical formulation in ``A construction for recursive linear orderings'' [J. Symb. Logic (to appear)], as well as related work by \textit{J. F. Knight} [Ann. Pure Appl. Logic 48, 237-259 (1990; Zbl 0712.03035)] and by \textit{S. Lempp} and \textit{M. Lerman} [Lect. Notes Math. 1432, 277-296 (1990; Zbl 0702.03019)].