Nonuniformization results for the projective hierarchy

Journal of Symbolic Logic 56 (2):742-748 (1991)
  Copy   BIBTEX

Abstract

Let X and Y be uncountable Polish spaces. We show in ZF that there is a coanalytic subset P of X × Y with countable sections which cannot be expressed as the union of countably many partial coanalytic, or even PCA = Σ 1 2 , graphs. If X = Y = ω ω , P may be taken to be Π 1 1 . Assuming stronger set theoretic axioms, we identify the least pointclass such that any such coanalytic P can be expressed as the union of countably many graphs in this pointclass. This last result is extended (under suitable hypotheses) to all levels of the projective hierarchy

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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

Solovay models and forcing extensions.Joan Bagaria & Roger Bosch - 2004 - Journal of Symbolic Logic 69 (3):742-766.
Countable functionals and the projective hierarchy.Dag Normann - 1981 - Journal of Symbolic Logic 46 (2):209-215.
Dominating and unbounded free sets.Slawomir Solecki & Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (1):75-80.
Undecidable theories of Lyndon algebras.Vera Stebletsova & Yde Venema - 2001 - Journal of Symbolic Logic 66 (1):207-224.
Cardinalities in the projective hierarchy.Greg Hjorth - 2002 - Journal of Symbolic Logic 67 (4):1351-1372.

Analytics

Added to PP
2009-01-28

Downloads
11 (#1,075,532)

6 months
5 (#544,079)

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

Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.

Add more references