Generic copies of countable structures (Q1123889): Difference between revisions

There is a series of papers concerning intrinsical relations, stability and categoricity of recursive structures in hyperarithmetical degrees [e.g. \textit{C. J. Ash}, Ann. Pure Appl. Logic 32, 113-135 (1986; Zbl 0631.03016)]. It was shown that for these properties there is a natural syntactic condition which is sufficient and, with additional assumptions, is also necessary. In this paper arbitrary structures whose domain is the set of natural numbers, not just recursive structures, are considered. Recursiveness of relations is replaced by recursiveness relative to the diagram of a structure. It is proved that for this generalization, the natural syntactic condition is both necessary and sufficient. This is done producing an isomorphic copy of a given structure by forcing with finite partial isomorphisms.