Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)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.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Indiscernible sequences for extenders, and the singular cardinal hypothesis.Moti Gitik & William J. Mitchell - 1996 - Annals of Pure and Applied Logic 82 (3):273-316.
    We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem. Suppose κ is a singular strong limit cardinal and 2κ λ where λ is not the successor of a cardinal of cofinality at most κ. If cf > ω then it follows that o λ, and if cf = ωthen either o λ or {α: K o α+n} is confinal in κ for (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • (2 other versions)Possible values for 2ℵn and 2ℵω.Moti Gitik & Carmi Merimovich - 1997 - Annals of Pure and Applied Logic 90 (1-3):193-241.
    Download  
     
    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κ=κ+α.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)The negation of the singular cardinal hypothesis from o(K)=K++.Moti Gitik - 1989 - Annals of Pure and Applied Logic 43 (3):209-234.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Easton’s theorem and large cardinals.Sy-David Friedman & Radek Honzik - 2008 - Annals of Pure and Applied Logic 154 (3):191-208.
    The continuum function αmaps to2α on regular cardinals is known to have great freedom. Let us say that F is an Easton function iff for regular cardinals α and β, image and α<β→F≤F. The classic example of an Easton function is the continuum function αmaps to2α on regular cardinals. If GCH holds then any Easton function is the continuum function on regular cardinals of some cofinality-preserving extension V[G]; we say that F is realised in V[G]. However if we also wish (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Perfect trees and elementary embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
    An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding j*: M[G] → N[G*] between generic extensions of them. This technique is crucial both in the study of large cardinal preservation and of internal consistency. In easy cases, such as when forcing to make the GCH hold while preserving a measurable cardinal (via a reverse Easton iteration of α-Cohen forcing for successor cardinals α), the (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A Power Function with a Fixed Finite Gap Everywhere.Carmi Merimovich - 2007 - Journal of Symbolic Logic 72 (2):361 - 417.
    We give an application of the extender based Radin forcing to cardinal arithmetic. Assuming κ is a large enough cardinal we construct a model satisfying 2κ = κ⁺ⁿ together with 2λ = λ⁺ⁿ for each cardinal λ < κ, where 0 < n < ω. The cofinality of κ can be set arbitrarily or κ can remain inaccessible. When κ remains an inaccessible, Vκ is a model of ZFC satisfying 2λ = λ+n for all cardinals λ.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)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 (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Powers of regular cardinals.William B. Easton - 1970 - Annals of Mathematical Logic 1 (2):139.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • On the Singular Cardinals problem.Jack Silver, Fred Galvin, Keith J. Devlin & R. B. Jensen - 1981 - Journal of Symbolic Logic 46 (4):864-866.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Perfect-set forcing for uncountable cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • How large is the first strongly compact cardinal? or a study on identity crises.Menachem Magidor - 1976 - Annals of Mathematical Logic 10 (1):33-57.
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • (2 other versions)Possible values for 2 (aleph n) and 2 (aleph omega).Moti Gitik & Carmi Merimovich - 1997 - Annals of Pure and Applied Logic 90 (1-3):193-241.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On certain indestructibility of strong cardinals and a question of Hajnal.Moti Gitik & Saharon Shelah - 1989 - Archive for Mathematical Logic 28 (1):35-42.
    A model in which strongness ofκ is indestructible under κ+ -weakly closed forcing notions satisfying the Prikry condition is constructed. This is applied to solve a question of Hajnal on the number of elements of {λ δ |2 δ <λ}.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • (1 other version)[Omnibus Review].Akihiro Kanamori - 1981 - Journal of Symbolic Logic 46 (4):864-866.
    Download  
     
    Export citation  
     
    Bookmark   71 citations