Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
    Suppose that α = γ + δ where $\gamma \geq \delta > 0$ . Then there is a graph G = (ω ω α ,E) which has no independent set of order type ω ω α and has no pentagram (a pentagram is a set of five points with all pairs joined by edges). In the notation of Erdos and Rado, who generalized Ramsey's Theorem to this setting, $\omega^{\omega^\alpha} \nrightarrow (\omega^{\omega^\alpha},5)^2.$.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Countable partition ordinals.Rene Schipperus - 2010 - Annals of Pure and Applied Logic 161 (10):1195-1215.
    The structure of ordinals of the form ωωβ for countable β is studied. The main result is:Theorem 1If β<ω1 is the sum of one or two indecomposable ordinals, thenωωβ→2. Also an example is given to show that α→2 need not imply α→2 for all n<ω.
    Download  
     
    Export citation  
     
    Bookmark  
  • A formalised theorem in the partition calculus.Lawrence C. Paulson - 2024 - Annals of Pure and Applied Logic 175 (1):103246.
    Download  
     
    Export citation  
     
    Bookmark   1 citation