Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • Substandard models of finite set theory.Laurence Kirby - 2010 - Mathematical Logic Quarterly 56 (6):631-642.
    A survey of the isomorphic submodels of Vω, the set of hereditarily finite sets. In the usual language of set theory, Vω has 2ℵ0 isomorphic submodels. But other set-theoretic languages give different systems of submodels. For example, the language of adjunction allows only countably many isomorphic submodels of Vω.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Generalizations of the Kunen inconsistency.Joel David Hamkins, Greg Kirmayer & Norman Lewis Perlmutter - 2012 - Annals of Pure and Applied Logic 163 (12):1872-1890.
    We present several generalizations of the well-known Kunen inconsistency that there is no nontrivial elementary embedding from the set-theoretic universe V to itself. For example, there is no elementary embedding from the universe V to a set-forcing extension V[G], or conversely from V[G] to V, or more generally from one set-forcing ground model of the universe to another, or between any two models that are eventually stationary correct, or from V to HOD, or conversely from HOD to V, or indeed (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Non-Well-Founded Sets.Peter Aczel - 1988 - Palo Alto, CA, USA: Csli Lecture Notes.
    Download  
     
    Export citation  
     
    Bookmark   140 citations  
  • Non-Well-founded Sets.J. L. Bell - 1989 - Journal of Symbolic Logic 54 (3):1111-1112.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.
    This paper starts by investigating Ackermann's interpretation of finite set theory in the natural numbers. We give a formal version of this interpretation from Peano arithmetic (PA) to Zermelo-Fraenkel set theory with the infinity axiom negated (ZF−inf) and provide an inverse interpretation going the other way. In particular, we emphasize the precise axiomatization of our set theory that is required and point out the necessity of the axiom of transitive containment or (equivalently) the axiom scheme of ∈-induction. This clarifies the (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
    Let P 0 be the subsystem of Peano arithmetic obtained by restricting induction to bounded quantifier formulas. Let M be a countable, nonstandard model of P 0 whose domain we suppose to be the standard integers. Let T be a recursively enumerable extension of Peano arithmetic all of whose existential consequences are satisfied in the standard model. Then there is an initial segment M ' of M which is a model of T such that the complete diagram of M ' (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Countable models of set theories.Harvey Friedman - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 539--573.
    Download  
     
    Export citation  
     
    Bookmark   27 citations