A Spector-Gandy theorem for cPCd(A) classes
Journal of Symbolic Logic 57 (2):478 - 500 (1992)
| Abstract | Let U be an admissible structure. A cPCd(U) class is the class of all models of a sentence of the form $\neg\exists\bar{K} \bigwedge \Phi$ , where K̄ is an U-r.e. set of relation symbols and φ is an U-r.e. set of formulas of L∞ω that are in U. The main theorem is a generalization of the following: Let U be a pure countable resolvable admissible structure such that U is not Σ-elementarily embedded in HYP(U). Then a class K of countable structures whose universes are sets of urelements is a cPCd(U) class if and only if for some Σ formula σ (with parameters from U), M is in K if and only if M is a countable structure with universe a set of urelements and $(\mathrm{HYP}_\mathfrak{U}(\mathfrak{M}), \mathfrak{U}, \mathfrak{M}) \models \sigma$ , where HYPU(M), the smallest admissible set above M relative to U, is a generalization of HYP to structures with similarity type Σ over U that is defined in this article. Here we just note that when Lα is admissible, HYPLα(M) is Lβ(M) for the least β ≥ α such that Lβ(M) is admissible, and so, in particular, that HYPHF(M) is just HYP(M) in the usual sense when M has a finite similarity type. The definition of HYPU(M) is most naturally formulated using Adamson's notion of a +-admissible structure (1978). We prove a generalization from admissible to +-admissible structures of the well-known truncation lemma. That generalization is a key theorem applied in the proof of the generalized Spector-Gandy theorem | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesFred G. Abramson (1979). Σ1-Separation. Journal of Symbolic Logic 44 (3):374 - 382.
Harvey Friedman & Lee Stanley (1989). A Borel Reducibility Theory for Classes of Countable Structures. Journal of Symbolic Logic 54 (3):894-914.
Shaughan Lavine (1991). Dual Easy Uniformization and Model-Theoretic Descriptive Set Theory. Journal of Symbolic Logic 56 (4):1290-1316.
Tom Linton (1991). Countable Structures, Ehrenfeucht Strategies, and Wadge Reductions. Journal of Symbolic Logic 56 (4):1325-1348.
Daniel Lascar (1992). Les Automorphismes d'Un Ensemble Fortement Minimal. Journal of Symbolic Logic 57 (1):238-251.
T. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
Victor Harnik & Michael Makkai (1976). Applications of Vaught Sentences and the Covering Theorem. Journal of Symbolic Logic 41 (1):171-187.
Sy D. Friedman (1979). HC of an Admissible Set. Journal of Symbolic Logic 44 (1):95-102.
Shaughan Lavine (1993). Generalized Reduction Theorems for Model-Theoretic Analogs of the Class of Coanalytic Sets. Journal of Symbolic Logic 58 (1):81-98.
Mark Nadel & Jonathan Stavi (1977). The Pure Part of HYP(M). Journal of Symbolic Logic 42 (1):33-46.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #234,778 of 556,888 )Recent downloads (6 months)1 ( #64,931 of 556,888 )How can I increase my downloads? |
My notes
Discussion
