A Spector-Gandy theorem for cPC_<i>d</i>() classes (Q4032633)

Let \({\mathfrak A}\) be an admissible structure. A \(\text{cPC}_ d({\mathfrak A})\) class is the class of all models of a sentence of the form \(\neg\exists\overline K\bigwedge\Phi\), where \(\overline K\) is an \({\mathfrak A}\)-r.e. set of relation symbols and \(\Phi\) is an \({\mathfrak A}\)-r.e. set of formulas of \({\mathcal L}_{\infty\omega}\) that are in \({\mathfrak A}\). The main theorem is a generalization of the following: Let \({\mathfrak A}\) be a pure countable resolvable admissible structure such that \({\mathfrak A}\) is not \(\Sigma\)-elementarily embedded in \(\text{HYP}({\mathfrak A})\). Then a class \(K\) of countable structures whose universes are sets of urelements is a \(\text{cPC}_ d({\mathfrak A})\) class if and only if for some \(\Sigma\) formula \(\sigma\) (with parameters from \({\mathfrak A})\), \({\mathfrak M}\) is in \(K\) if and only if \({\mathfrak M}\) is a countable structure with universe a set of urelements and \((\text{HYP}_{\mathfrak A}({\mathfrak M}),{\mathfrak A},{\mathfrak M})\models\sigma\), where \(\text{HYP}_{\mathfrak A}({\mathfrak M})\), the smallest admissible set above \({\mathfrak M}\) relative to \({\mathfrak A}\), is a generalization of HYP to structures with similarity type \(\Sigma\) over \({\mathfrak A}\) that is defined in this article. Here we just note that when L\(_ \alpha\) is admissible, \(\text{HYP}_{\text{L}_ \alpha}({\mathfrak M})\) is L\(_ \beta({\mathfrak M})\) for the least \(\beta\geq\alpha\) such that L\(_ \beta({\mathfrak M})\) is admissible, and so, in particular, that \(\text{HYP}_{\mathbb{H}\mathbb{F}}({\mathfrak M})\) is just \(\text{HYP}({\mathfrak M})\) in the usual sense when \({\mathfrak M}\) has a finite similarity type. The definition of \(\text{HYP}_{\mathfrak A}({\mathfrak M})\) is most naturally formulated using Adamson's notion of a +-admissible structure (1978). We prove a generalization of the well-known truncation lemma from admissible to +-admissible structures. That generalization is a key theorem applied in the proof of the generalized Spector-Gandy theorem.