Switch to: References

Add citations

You must login to add citations.
  1. Complicated colorings, revisited.Assaf Rinot & Jing Zhang - 2023 - Annals of Pure and Applied Logic 174 (4):103243.
    Download  
     
    Export citation  
     
    Bookmark  
  • Strong colorings over partitions.William Chen-Mertens, Menachem Kojman & Juris Steprāns - 2021 - Bulletin of Symbolic Logic 27 (1):67-90.
    A strong coloring on a cardinal $\kappa $ is a function $f:[\kappa ]^2\to \kappa $ such that for every $A\subseteq \kappa $ of full size $\kappa $, every color $\unicode{x3b3} <\kappa $ is attained by $f\restriction [A]^2$. The symbol $$ \begin{align*} \kappa\nrightarrow[\kappa]^2_{\kappa} \end{align*} $$ asserts the existence of a strong coloring on $\kappa $.We introduce the symbol $$ \begin{align*} \kappa\nrightarrow_p[\kappa]^2_{\kappa} \end{align*} $$ which asserts the existence of a coloring $f:[\kappa ]^2\to \kappa $ which is strong over a partition $p:[\kappa ]^2\to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Chain conditions of products, and weakly compact cardinals.Assaf Rinot - 2014 - Bulletin of Symbolic Logic 20 (3):293-314,.
    The history of productivity of the κ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal κ > א1, the principle □ is equivalent to the existence of a certain strong coloring c : [κ]2 → κ for which the family of fibers T is a nonspecial κ-Aronszajn tree. The theorem follows from an analysis of (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
    We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the simplest of our results establishes that if μ is singular and , then there is a regular cardinal θ<μ such that any fewer than cf stationary subsets of must reflect simultaneously.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Karp complexity and classes with the independence property.M. C. Laskowski & S. Shelah - 2003 - Annals of Pure and Applied Logic 120 (1-3):263-283.
    A class K of structures is controlled if for all cardinals λ, the relation of L∞,λ-equivalence partitions K into a set of equivalence classes . We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled 69–88).
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Getting more colors I.Todd Eisworth - 2013 - Journal of Symbolic Logic 78 (1):1-16.
    We establish a coloring theorem for successors of singular cardinals, and use it prove that for any such cardinal $\mu$, we have $\mu^+\nrightarrow[\mu^+]^2_{\mu^+}$ if and only if $\mu^+\nrightarrow[\mu^+]^2_{\theta}$ for arbitrarily large $\theta < \mu$.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Getting more colors II.Todd Eisworth - 2013 - Journal of Symbolic Logic 78 (1):17-38.
    We formulate and prove (in ZFC) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer several questions concerning Shelah's principle $Pr_1(\mu^+,\mu^+,\mu^+,cf(\mu))$ for singular $\mu$.
    Download  
     
    Export citation  
     
    Bookmark   4 citations