Dual easy uniformization and model-theoretic descriptive set theory

Journal of Symbolic Logic 56 (4):1290-1316 (1991)
  Copy   BIBTEX

Abstract

It is well known that, in the terminology of Moschovakis, Descriptive set theory (1980), every adequate normed pointclass closed under ∀ω has an effective version of the generalized reduction property (GRP) called the easy uniformization property (EUP). We prove a dual result: every adequate normed pointclass closed under ∃ω has the EUP. Moschovakis was concerned with the descriptive set theory of subsets of Polish topological spaces. We set up a general framework for parts of descriptive set theory and prove results that have as special cases not only the just-mentioned topological results, but also corresponding results concerning the descriptive set theory of classes of structures. Vaught (1973) asked whether the class of cPCδ classes of countable structures has the GRP. It does. A cPC(A) class is the class of all models of a sentence of the form ¬∃K̄φ, where φ is a sentence of L∞ω that is in A and K̄ is a set of relation symbols that is in A. Vaught also asked whether there is any primitive recursively closed set A such that some effective version of the GRP holds for the class of cPC(A) classes of countable structures. There is: The class of cPC(A) classes of countable structures has the EUP if ω ∈ A and A is countable and primitive recursively closed. Those results and some extensions are obtained by first showing that the relevant classes of classes of structures, which Vaught showed normed, are in a suitable sense adequate and closed under ∃ω, and then applying the dual easy uniformization theorem

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,090

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Index sets for some classes of structures.Ekaterina B. Fokina - 2009 - Annals of Pure and Applied Logic 157 (2-3):139-147.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
Trees and -subsets of ω1ω1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.
Classification from a computable viewpoint.Wesley Calvert & Julia F. Knight - 2006 - Bulletin of Symbolic Logic 12 (2):191-218.
Dominating and unbounded free sets.Slawomir Solecki & Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (1):75-80.
A Spector-Gandy theorem for cPC d () classes.Shaughan Lavine - 1992 - Journal of Symbolic Logic 57 (2):478-500.

Analytics

Added to PP
2009-01-28

Downloads
59 (#376,787)

6 months
4 (#866,409)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references