Article contents
Nonuniformization results for the projective hierarchy
Published online by Cambridge University Press: 12 March 2014
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 = , graphs. If X = Y = ωω, P may be taken to be
. 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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1991
References
REFERENCES
- 1
- Cited by