Invariant uniformization
The basic result of this paper is the construction of a forcing model in which the family of unordered pairs of isomorphism types of bireals (two-way infinite strings of 0's and 1's), has no choice function which is definable from a countable sequence of ordinals. Although the construction is by now routine, there are many interesting corollaries of the result, among them: it is consistent to assume that one cannot pick (in a manner definable from a countable sequence of ordinals) a point from each countable linear order. Another concerns picking an enumeration of each countable well-ordering. The results are then given a general setting in terms of descriptive set theory, where they can be interpreted as saying that an invariant version of the Kondo-Addison Uniformization Theorem fails.
This page was built for publication: Invariant uniformization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133636)