Techniques for approaching the dual Ramsey property in the projective hierarchy. (Q700582): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.2140/pjm.2001.200.119 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.2140/PJM.2001.200.119 / rank
 
Normal rank

Revision as of 07:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Techniques for approaching the dual Ramsey property in the projective hierarchy.
scientific article

    Statements

    Techniques for approaching the dual Ramsey property in the projective hierarchy. (English)
    0 references
    0 references
    0 references
    22 October 2002
    0 references
    The Ramsey property concerns infinite sets of integers, while the dual Ramsey property, which was introduced by Carlson and Simpson, concerns infinite partitions of the natural numbers [\textit{T. J. Carlson} and \textit{S. G. Simpson}, Adv. Math. 53, 265--290 (1984; Zbl 0564.05005)]. In this paper the authors pursue similarities between the Ramsey property and the dual Ramsey property vis-â-vis sets in the first levels of the projective hierarchy. Dualizations of objects and concepts are the authors' initial focus. They prove a forcing equivalence theorem for dual Mathias forcing and dual Laver forcing. They also show that the Harrington-Kechris techniques for proving the Ramsey property from determinacy work for the dual Ramsey property too.
    0 references
    0 references
    Ramsey property
    0 references
    dual Ramsey property
    0 references
    projective hierarchy
    0 references
    determinacy
    0 references
    forcing equivalence theorem
    0 references
    dual Mathias forcing
    0 references
    dual Laver forcing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references