Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • (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  
  • The poset of all copies of the random graph has the 2-localization property.Miloš S. Kurilić & Stevo Todorčević - 2016 - Annals of Pure and Applied Logic 167 (8):649-662.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Every countable model of set theory embeds into its own constructible universe.Joel David Hamkins - 2013 - Journal of Mathematical Logic 13 (2):1350006.
    The main theorem of this article is that every countable model of set theory 〈M, ∈M〉, including every well-founded model, is isomorphic to a submodel of its own constructible universe 〈LM, ∈M〉 by means of an embedding j : M → LM. It follows from the proof that the countable models of set theory are linearly pre-ordered by embeddability: if 〈M, ∈M〉 and 〈N, ∈N〉 are countable models of set theory, then either M is isomorphic to a submodel of N (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Set Theory. An Introduction to Independence Proofs.James E. Baumgartner & Kenneth Kunen - 1986 - Journal of Symbolic Logic 51 (2):462.
    Download  
     
    Export citation  
     
    Bookmark   149 citations