Switch to: References

Citations of:

Was sierpinski right? IV

Journal of Symbolic Logic 65 (3):1031-1054 (2000)

Add citations

You must login to add citations.
  1. Changing cardinal characteristics without changing ω-sequences or cofinalities.Heike Mildenberger & Saharon Shelah - 2000 - Annals of Pure and Applied Logic 106 (1-3):207-261.
    We show: There are pairs of universes V1V2 and there is a notion of forcing PV1 such that the change mentioned in the title occurs when going from V1[G] to V2[G] for a P-generic filter G over V2. We use forcing iterations with partial memories. Moreover, we implement highly transitive automorphism groups into the forcing orders.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the existence of universal models.Mirna Džamonja & Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (7):901-936.
    Suppose that λ=λ <λ ≥ℵ0, and we are considering a theory T. We give a criterion on T which is sufficient for the consistent existence of λ++ universal models of T of size λ+ for models of T of size ≤λ+, and is meaningful when 2λ +>λ++. In fact, we work more generally with abstract elementary classes. The criterion for the consistent existence of universals applies to various well known theories, such as triangle-free graphs and simple theories. Having in mind (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Forcing axioms for λ‐complete μ+$\mu ^+$‐c.c.Saharon Shelah - 2022 - Mathematical Logic Quarterly 68 (1):6-26.
    We consider forcing axioms for suitable families of μ‐complete ‐c.c. forcing notions. We show that some form of the condition “ have a in ” is necessary. We also show some versions are really stronger than others.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generating ultrafilters in a reasonable way.Andrzej Rosłanowski & Saharon Shelah - 2008 - Mathematical Logic Quarterly 54 (2):202-220.
    We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah [8]. We introduce a general scheme of generating a filter on λ from filters on smaller sets and we investigate the combinatorics of objects obtained this way.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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