# Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets

Journal of Symbolic Logic 58 (1):81-98 (1993)
 Abstract Let A be an admissible set. A sentence of the form ∀R̄φ is a ∀1(A) (∀s 1(A),∀1(Lω1ω)) sentence if φ ∈ A (φ is $\bigvee\Phi$ , where Φ is an A-r.e. set of sentences from A; φ ∈ Lω1ω). A sentence of the form ∃R̄φ is an ∃2(A) (∃s 2(A),∃2(Lω1ω)) sentence if φ is a ∀1(A) (∀s 1(A),∀1(Lω1ω)) sentence. A class of structures is, for example, a ∀1(A) class if it is the class of models of a ∀1(A) sentence. Thus ∀1(A) is a class of classes of structures, and so forth. Let Mi be the structure $\langle i, 0$. Let Γ be a class of classes of structures. We say that a sequence $J_1,\ldots,J_i,\ldots, i < \omega$, of classes of structures is a Γ sequence if $J_i \in \Gamma, i < \omega$, and there is I ∈ Γ such that M ∈ Ji if and only if [M, Mi] ∈ I, where [,] is the disjoint sum. A class Γ of classes of structures has the easy uniformization property if for every Γ sequence $J_1,\ldots,J_i, \ldots, i < \omega$, there is a Γ sequence $J'_1,\ldots,J'_i,\ldots, i < \omega$, such that $J'_i \subseteq J_i, i < \omega, \bigcup J'_i = \bigcup J_i$, and the J'i are pairwise disjoint. The easy uniformization property is an effective version of Kuratowski's generalized reduction property that is closely related to Moschovakis's (topological) easy uniformization property. We show over countable structures that ∀1(A) and ∃2(A) have the easy uniformization property if A is a countable admissible set with an infinite member, that ∀s 1(Lα) and ∃s 2(Lα) have the easy uniformization property if α is countable, admissible, and not weakly stable, and that ∀1(Lω1ω) and ∃2(Lω1ω) have the easy uniformization property. The results proved are more general. The result for ∀s 1(Lα) answers a question of Vaught (1980) Keywords No keywords specified (fix it) Categories Logic and Philosophy of Logic (categorize this paper) DOI 10.2307/2275326 Options Save to my reading list Follow the author(s) Edit this record My bibliography Export citation Mark as duplicate Request removal from index
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,861

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
References found in this work BETA
Admissible Sets and the Saturation of Structures.Alan Adamson - 1978 - Annals of Mathematical Logic 14 (2):111-157.
Citations of this work BETA

No citations found.

Similar books and articles
Stationary Sets and Infinitary Logic.Saharon Shelah & Jouko Väänänen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
Russell's Paradox.Kevin C. Klement - 2001 - Internet Encyclopedia of Philosophy.
Countable Structures, Ehrenfeucht Strategies, and Wadge Reductions.Tom Linton - 1991 - Journal of Symbolic Logic 56 (4):1325-1348.
A Spector-Gandy Theorem for cPCd(A) Classes.Shaughan Lavine - 1992 - Journal of Symbolic Logic 57 (2):478 - 500.