Nonuniformization Results for the Projective Hierarchy
Jackson, Steve ; Mauldin, R. Daniel
J. Symbolic Logic, Tome 56 (1991) no. 1, p. 742-748 / Harvested from Project Euclid
Let $X$ and $Y$ be uncountable Polish spaces. We show in ZF that there is a coanalytic subset $P$ of $X \times Y$ with countable sections which cannot be expressed as the union of countably many partial coanalytic, or even $\mathrm{PCA} = \Sigma^1_2$, graphs. If $X = Y = \omega^\omega, P$ may be taken to be $\Pi^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.
Publié le : 1991-06-14
Classification:  Coanalytic,  countable uniformiza,  game quantifier,  04A15,  03E60,  28A05
@article{1183743672,
     author = {Jackson, Steve and Mauldin, R. Daniel},
     title = {Nonuniformization Results for the Projective Hierarchy},
     journal = {J. Symbolic Logic},
     volume = {56},
     number = {1},
     year = {1991},
     pages = { 742-748},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183743672}
}
Jackson, Steve; Mauldin, R. Daniel. Nonuniformization Results for the Projective Hierarchy. J. Symbolic Logic, Tome 56 (1991) no. 1, pp.  742-748. http://gdmltest.u-ga.fr/item/1183743672/