Switch to: Citations

Add references

You must login to add references.
  1. Saharon Shelah, Cardinal Arithmetic. [REVIEW]Saharon Shelah - 1998 - Studia Logica 60 (3):443-448.
    Direct download  
     
    Export citation  
     
    Bookmark   59 citations  
  • The negation of the singular cardinal hypothesis from o(K)=K++.Moti Gitik - 1989 - Annals of Pure and Applied Logic 43 (3):209-234.
  • The negation of the singular cardinal hypothesis from< i> o(< i> K_)=< i> K< sup>++.Moti Gitik - 1989 - Annals of Pure and Applied Logic 43 (3):209-234.
  • The strenght of the failure of the singular cardinal hypothesis.Moti Gitik - 1991 - Annals of Pure and Applied Logic 51 (3):215-240.
    We show that o = k++ is necessary for ¬SCH. Together with previous results it provides the exact strenght of ¬SCH.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  • On hidden extenders.Moti Gitik - 1996 - Archive for Mathematical Logic 35 (5-6):349-369.
    We prove the following theorem: Suppose that there is a singular $\kappa$ with the set of $\alpha$ 's with $o(\alpha)=\alpha^{+n}$ unbounded in it for every $n < \omega$ . Then in a generic extesion there are two precovering sets which disagree about common indiscernibles unboundedly often.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • On measurable cardinals violating the continuum hypothesis.Moti Gitik - 1993 - Annals of Pure and Applied Logic 63 (3):227-240.
    Gitik, M., On measurable cardinals violating the continuum hypothesis, Annals of Pure and Applied Logic 63 227-240. It is shown that an extender used uncountably many times in an iteration is reconstructible. This together with the Weak Covering Lemma is used to show that the assumption o=κ+α is necessary for a measurable κ with 2κ=κ+α.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Extender based forcings.Moti Gitik & Menachem Magidor - 1994 - Journal of Symbolic Logic 59 (2):445-460.
    The paper is a continuation of [The SCH revisited]. In § 1 we define a forcing with countably many nice systems. It is used, for example, to construct a model "GCH below κ, c f κ = ℵ0, and $2^\kappa > \kappa^{+\omega}$" from 0(κ) = κ+ω. In § 2 we define a triangle iteration and use it to construct a model satisfying "{μ ≤ λ∣ c f μ = ℵ0 and $pp(\mu) > \lambda\}$ is countable for some λ". The question (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • The covering lemma for L[U].A. J. Dodd & R. B. Jensen - 1982 - Annals of Mathematical Logic 22 (2):127-135.
  • The covering lemma for K.Tony Dodd & Ronald Jensen - 1982 - Annals of Mathematical Logic 22 (1):1-30.
  • The core model.A. Dodd & R. Jensen - 1981 - Annals of Mathematical Logic 20 (1):43-75.