Abstract
Given two sets X, Y and P ⊆ X × Y, a uniformization of P is a subset P* ⊆ P such that for all x ∈ X, Ǝ!yP(x,y) ⇔Ǝ!yP*(x,y) (where Ǝ! stands for “there exists unique”). In other words, P* is the graph of a function f with domain A = proj x (P) such that f(x) ∈ P x for every x ∈ A. Such an f is called a uniformizing function for P.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Kechris, A.S. (1995). Uniformization Theorems. In: Classical Descriptive Set Theory. Graduate Texts in Mathematics, vol 156. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4190-4_18
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4190-4_18
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8692-9
Online ISBN: 978-1-4612-4190-4
eBook Packages: Springer Book Archive