Inseparability in recursive copies (Q1326768)

The author continues the Ash programme of analysing (hyper)arithmetical properties of recursive models with respect to isomorphism types [e.g. \textit{C. J. Ash}, Trans. Am. Math. Soc. 298, 497-514 (1986; Zbl 0631.03017)]. The author looks at constructions which, subject to the usual sort of infinitary decidability conditions, allow one to find a copy of a recursive structure in which two given disjoint relations are \(\Delta^ 0_ \alpha\) separable. He applies the model-theoretical results to Boolean algebras, vector spaces and orderings.