No label defined (Q4938559)

A structure \(A\) represents a Scott set \(S\) if for all types \(\Gamma(\bar u,x)\) containing formulas which are Boolean combinations of \(\Sigma_n\) formulas, for fixed \(n\), and all tuples \(\bar c\) in \(A\), \(\Gamma(\bar c,x)\) is realized in \(A\) iff is is finitely realized in \(A\). The author proves several general results concerning complete theories, their models, and Scott sets they represent. The main technical tool is a new metatheorem for nested priority constructions. The results are then applied to give readable and complete proofs of the now classical theorems of Solovay, and Solovay and Marker, on degrees of models of arithmetic and their standard systems. In particular, it is shown that the degrees of nonstandard models of True Arithmetic are the degrees of enumerations of Scott sets which contain the arithmetical sets. The last section of the paper contains a list of important open problems. For the entire collection see [Zbl 0919.00039].