Sufficiency conditions for theories with recursive models (Q1184717)

A structure coded as a subset of \(\omega\) is called recursive if its open diagram is recursive. The paper at hand examines decidability conditions which guarantee that a theory has a recursive model. The fairly complex model-theoretic conditions are based upon the Ash-Knight [\textit{C. J. Ash} and \textit{J. F. Knight}, Ann. Pure Appl. Logic 46, 211-234 (1990; Zbl 0712.03020)] `\(\alpha\)-friendly' systems, and the technical device used in the construction is Ash's recursive labelling systems (in the metric space setting) à la Ash [\textit{C. J. Ash}, Trans. Am. Math. Soc. 298, 497-514 (1986; Zbl 0631.03017)]. An application to making complicated recursive linear orderings whose theories have degree \(\text{\textbf{0}}^{(\omega)}\) is given.