Switch to: References

Add citations

You must login to add citations.
  1. Measurable cardinals and good ‐wellorderings.Philipp Lücke & Philipp Schlicht - 2018 - Mathematical Logic Quarterly 64 (3):207-217.
    We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals κ with the property that the collection of all initial segments of the wellordering is definable by a Σ1‐formula with parameter κ. A short argument shows that the existence of a measurable cardinal δ implies that such wellorderings do not exist at δ‐inaccessible cardinals of cofinality not equal to δ and their successors. In contrast, our main result shows that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (2 other versions)The model< i> N=∪{< i> L_[A]:< i> A countable set of ordinals}.Claude Sureson - 1987 - Annals of Pure and Applied Logic 36 (C):289-313.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Iterated extended ultrapowers and supercompactness without choice.Mitchell Spector - 1991 - Annals of Pure and Applied Logic 54 (2):179-194.
    Working in ZF + DC with no additional use of the axiom of choice, we show how to iterate the extended ultrapower construction of Spector . This generalizes the technique of iterated ultrapowers to choiceless set theory. As an application, we prove the following theorem: Assume V = LU[κ] + “κ is λ-supercompact with normal ultrafilter U” + DC. Then for every sufficiently large regular cardinal ρ, there exists a set-generic extension V[G] of the universe in which there exists for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • About Prikry generic extensions.Claude Sureson - 1991 - Annals of Pure and Applied Logic 51 (3):247-278.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Some properties of κ-complete ideals defined in terms of infinite games.Thomas J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):31-45.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Elementary embeddings and infinitary combinatorics.Kenneth Kunen - 1971 - Journal of Symbolic Logic 36 (3):407-413.
    One of the standard ways of postulating large cardinal axioms is to consider elementary embeddings,j, from the universe,V, into some transitive submodel,M. See Reinhardt–Solovay [7] for more details. Ifjis not the identity, andκis the first ordinal moved byj, thenκis a measurable cardinal. Conversely, Scott [8] showed that wheneverκis measurable, there is suchjandM. If we had assumed, in addition, that, thenκwould be theκth measurable cardinal; in general, the wider we assumeMto be, the largerκmust be.
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • Undefinable sets.Rudolf V. B. Rucker - 1974 - Annals of Mathematical Logic 6 (3):395.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Some combinatorial problems concerning uncountable cardinals.Thomas J. Jech - 1973 - Annals of Mathematical Logic 5 (3):165.
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • (1 other version)Contributions to the Theory of Semisets IV.Petr Štêpánek - 1974 - Mathematical Logic Quarterly 20 (23‐24):373-384.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the ultrafilter of closed, unbounded sets.D. A. Martin & W. Mitchell - 1979 - Journal of Symbolic Logic 44 (4):503-506.
    Download  
     
    Export citation  
     
    Bookmark  
  • On p-points over a measurable cardinal.A. Kanamori - 1981 - Journal of Symbolic Logic 46 (1):59-66.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)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  
  • Extended ultrapowers and the vopěnka-hrbáček theorem without choice.Mitchell Spector - 1991 - Journal of Symbolic Logic 56 (2):592-607.
    We generalize the ultrapower in a way suitable for choiceless set theory. Given an ultrafilter, forcing is used to construct an extended ultrapower of the universe, designed so that the fundamental theorem of ultrapowers holds even in the absence of the axiom of choice. If, in addition, we assume DC, then an extended ultrapower of the universe by a countably complete ultrafilter must be well-founded. As an application, we prove the Vopěnka-Hrbáček theorem from ZF + DC only (the proof of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Ramsey cardinals and constructibility.William Mitchell - 1979 - Journal of Symbolic Logic 44 (2):260-266.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Strong cardinals in the core model.Kai Hauser & Greg Hjorth - 1997 - Annals of Pure and Applied Logic 83 (2):165-198.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Chang's model and covering properties.Claude Sureson - 1989 - Annals of Pure and Applied Logic 42 (1):45-79.
    Download  
     
    Export citation  
     
    Bookmark   2 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  
  • Some examples of precipitous ideals.Thomas J. Jech & William J. Mitchell - 1983 - Annals of Pure and Applied Logic 24 (2):131-151.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The definability of E in self-iterable mice.Farmer Schlutzenberg - 2023 - Annals of Pure and Applied Logic 174 (2):103208.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Boolean extensions and measurable cardinals.K. Kunen - 1971 - Annals of Mathematical Logic 2 (4):359.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Ultrafilters over a measurable cardinal.A. Kanamori - 1976 - Annals of Mathematical Logic 10 (3-4):315-356.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (2 other versions)The model N = ∪ {L[A]: A countable set of ordinals}.Claude Sureson - 1987 - Annals of Pure and Applied Logic 36:289-313.
    This paper continues the study of covering properties of models closed under countable sequences. In a previous article we focused on C. Chang's Model . Our purpose is now to deal with the model N = ∪ { L [A]: A countable ⊂ Ord}. We study here relations between covering properties, satisfaction of ZF by N , and cardinality of power sets. Under large cardinal assumptions N is strictly included in Chang's Model C , it may thus be interesting to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Nonstandard characterisations of tensor products and monads in the theory of ultrafilters.Lorenzo Luperi Baglini - 2019 - Mathematical Logic Quarterly 65 (3):347-369.
    We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as by characterising their combinatorial properties by means of their monads. This extends to arbitrary sets and properties methods previously used to study partition regular Diophantine equations on. Several applications are described by means of multiple examples.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Some properties of kappa-complete ideals defined in terms of infinite games.T. J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):31.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Weakly measurable cardinals.Jason A. Schanker - 2011 - Mathematical Logic Quarterly 57 (3):266-280.
    In this article, we introduce the notion of weakly measurable cardinal, a new large cardinal concept obtained by weakening the familiar concept of a measurable cardinal. Specifically, a cardinal κ is weakly measurable if for any collection equation image containing at most κ+ many subsets of κ, there exists a nonprincipal κ-complete filter on κ measuring all sets in equation image. Every measurable cardinal is weakly measurable, but a weakly measurable cardinal need not be measurable. Moreover, while the GCH cannot (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A saturation property of ideals and weakly compact cardinals.Joji Takahashi - 1986 - Journal of Symbolic Logic 51 (3):513-525.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)How large is the first strongly compact cardinal? or: A study on identity crises.Menachem Magidor - 1976 - Annals of Mathematical Logic 10 (1):33.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Partition properties of m-ultrafilters and ideals.Joji Takahashi - 1987 - Journal of Symbolic Logic 52 (4):897-907.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Standardization principle of nonstandard universes.Masahiko Murakami - 1999 - Journal of Symbolic Logic 64 (4):1645-1655.
    A bounded ultrasheaf is a nonstandard universe constructed from a superstructure in a Boolean valued model of set theory. We consider the bounded elementary embeddings between bounded ultrasheaves. Then the standardization principle is true if and only if the ultrafilters are comparable by the Rudin-Frolik order. The base concept is that the bounded elementary embeddings correspond to the complete Boolean homomorphisms. We represent this by the Rudin-Keisler order of ultrafilters of Boolean algebras.
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)The model "N" = [union].Claude Sureson - 1987 - Annals of Pure and Applied Logic 36:289.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Contributions to the Theory of Semisets IV.Petr Štêpánek - 1974 - Mathematical Logic Quarterly 20 (23-24):373-384.
    Download  
     
    Export citation  
     
    Bookmark  
  • Analytic determinacy and 0#. [REVIEW]Leo Harrington - 1978 - Journal of Symbolic Logic 43 (4):685 - 693.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Precipitous ideals.T. Jech, M. Magidor, W. Mitchell & K. Prikry - 1980 - Journal of Symbolic Logic 45 (1):1-8.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • The comparison lemma.John R. Steel - forthcoming - Annals of Pure and Applied Logic.
    Download  
     
    Export citation  
     
    Bookmark