Partitioning pairs of countable ordinals (Q1111550): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Weak Partition Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complete subgraphs of graphs defined by systems of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some counterexamples in the partition calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some higher-gap examples in combinatorial set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regressive Partition Relations for Infinite Cardinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games and reduced products / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fine structure of the constructible hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing uncountable squares to countably many chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can you take Solovay's inaccessible away? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Was Sierpinski right? I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph which embeds all small graphs on any large set of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong negative partition above the continuum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraspecial p-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition relations for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aronszajn trees and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning pairs of countable ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3784060 / rank
 
Normal rank

Latest revision as of 10:49, 19 June 2024

scientific article
Language Label Description Also known as
English
Partitioning pairs of countable ordinals
scientific article

    Statements

    Partitioning pairs of countable ordinals (English)
    0 references
    0 references
    1987
    0 references
    It is proved that \(\omega_ 1\nrightarrow [\omega_ 1]^ 2_{\omega_ 1}\). The paper not only contains this striking, deep, new result, but a careful exposition of the completely new method applied here, the method of ``Todorcevic walks''. Among the applications given one can find short proofs for the existence of Countryman types, Souslin trees (when a Cohen real is added). The results are also extended to larger cardinals, for those with a nonreflecting stationary set for the original result, and for those having a square sequence for other results. A powerful stepping up lemma is proved. It is sketched how other extensions are given (mostly by S. Shelah).
    0 references
    0 references
    partition relation
    0 references
    Todorcevic walks
    0 references
    Countryman types
    0 references
    Souslin trees
    0 references
    square sequence
    0 references
    0 references