Switch to: Citations

Add references

You must login to add references.
  1. Rowbottom cardinals and Jonsson cardinals are almost the same.E. M. Kleinberg - 1973 - Journal of Symbolic Logic 38 (3):423-427.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Some remarks on changing cofinalities.Keith J. Devlin - 1974 - Journal of Symbolic Logic 39 (1):27-30.
    In [2], Prikry showed that if κ is a weakly inaccessible cardinal which carries a Rowbottom filter, then there is a Boolean extension of V (the universe), having the same cardinals as V, in which cf(κ) = ω. In this note, we obtain necessary and sufficient conditions which a filter D on κ must possess in order that this may be done.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Some weak versions of large cardinal axioms.Keith J. Devlin - 1973 - Annals of Mathematical Logic 5 (4):291.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Ultrafilters on a countable set.David Booth - 1970 - Annals of Mathematical Logic 2 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • The intersection of nonstandard models of arithmetic.Andreas Blass - 1972 - Journal of Symbolic Logic 37 (1):103-106.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • From Accessible to Inaccessible Cardinals.H. J. Keisler & A. Tarski - 1967 - Journal of Symbolic Logic 32 (3):411-411.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Sets constructible from sequences of ultrafilters.William J. Mitchell - 1974 - Journal of Symbolic Logic 39 (1):57-66.
    In [4], Kunen used iterated ultrapowers to show that ifUis a normalκ-complete nontrivial ultrafilter on a cardinalκthenL[U], the class of sets constructive fromU, has only the ultrafilterU∩L[U] and this ultrafilter depends only onκ. In this paper we extend Kunen's methods to arbitrary sequencesUof ultrafilters and obtain generalizations of these results. In particular we answer Problem 1 of Kunen and Paris [5] which asks whether the number of ultrafilters onκcan be intermediate between 1 and 22κ. If there is a normalκ-complete ultrafilterUonκsuch (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Strong axioms of infinity and elementary embeddings.Robert M. Solovay - 1978 - Annals of Mathematical Logic 13 (1):73.
    Download  
     
    Export citation  
     
    Bookmark   121 citations  
  • Boolean extensions and measurable cardinals.K. Kunen - 1971 - Annals of Mathematical Logic 2 (4):359.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Some applications of iterated ultrapowers in set theory.Kenneth Kunen - 1970 - Annals of Mathematical Logic 1 (2):179.
    Download  
     
    Export citation  
     
    Bookmark   96 citations  
  • (1 other version)On descendingly complete ultrafilters.Karel Prikry - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 459--488.
    Download  
     
    Export citation  
     
    Bookmark   6 citations