On disjoint Borel uniformizations (Q1805831): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5186348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic determinacy and 0<sup>#</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting and uniformising Borel sets with <i> K <sub>σ</sub> </i> ‐sections II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel Parametrizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Borel sets and functions and the structure of Baire class 1 functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing with tagged trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156783 / rank
 
Normal rank

Latest revision as of 08:48, 29 May 2024

scientific article
Language Label Description Also known as
English
On disjoint Borel uniformizations
scientific article

    Statements

    On disjoint Borel uniformizations (English)
    0 references
    0 references
    0 references
    30 January 2000
    0 references
    In 1973, D. G. Larmann showed that any closed subset of the plane with uncountable vertical cross-sections has \(\aleph_1\) disjoint Borel uniformizing sets. In the paper under review it is shown that Larmann's result is best possible: there exist closed sets with uncountable cross-sections which do not have more than \(\aleph_1\) disjoint Borel uniformizations, even if the continuum is much larger than \(\aleph_1\). This also answers some questions of Mauldin in the negative. The proof is based on a result of Stern, which uses Steel' method of forcing with tagged trees. In the present paper, a full presentation of this method, written in terms of Baire Category rather than forcing, is given.
    0 references
    Borel uniformization
    0 references
    Borel sets
    0 references
    cross section
    0 references
    Baire category
    0 references

    Identifiers