Invariant uniformization (Q4133636)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3557790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Invariant uniformization |
scientific article; zbMATH DE number 3557790 |
Statements
Invariant uniformization (English)
0 references
1976
0 references
0.75234055519104
0 references
0.7218004465103149
0 references
0.6996780037879944
0 references
0.6996738910675049
0 references
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.
0 references
