Computability in structures representing a Scott set (Q5945007)

In this paper the author utilizes a notion of forcing for which the generic objects are are structures and which allows him to compute certain sets and enumerations. Considering a characterization of sets of natural numbers computable in all models of a given theory representing a given Scott set, the author shows that the characteristic function of such a set must be enumeration reducible to a complete existential type which is consistent with the given theory and is an element of the given Scott set. The author also shows that there exist models of of completions of ZF from which one cannot enumerate the family of sets represented by the theory.