Switch to: Citations

Add references

You must login to add references.
  1. On generic extensions without the axiom of choice.G. P. Monro - 1983 - Journal of Symbolic Logic 48 (1):39-52.
    Let ZF denote Zermelo-Fraenkel set theory (without the axiom of choice), and let $M$ be a countable transitive model of ZF. The method of forcing extends $M$ to another model $M\lbrack G\rbrack$ of ZF (a "generic extension"). If the axiom of choice holds in $M$ it also holds in $M\lbrack G\rbrack$, that is, the axiom of choice is preserved by generic extensions. We show that this is not true for many weak forms of the axiom of choice, and we derive (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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  
  • Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.
    In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2ω = ω2 and that [Formula: see text] satisfies the Axiom of Choice. It will also be demonstrated that this reflection principle implies that □ fails for all regular κ > ω1.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • The Bristol model: An abyss called a Cohen real.Asaf Karagila - 2018 - Journal of Mathematical Logic 18 (2):1850008.
    We construct a model [Formula: see text] of [Formula: see text] which lies between [Formula: see text] and [Formula: see text] for a Cohen real [Formula: see text] and does not have the form [Formula: see text] for any set [Formula: see text]. This is loosely based on the unwritten work done in a Bristol workshop about Woodin’s HOD Conjecture in 2011. The construction given here allows for a finer analysis of the needed assumptions on the ground models, thus taking (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Suitable extender models I.W. Hugh Woodin - 2010 - Journal of Mathematical Logic 10 (1):101-339.
    We investigate both iteration hypotheses and extender models at the level of one supercompact cardinal. The HOD Conjecture is introduced and shown to be a key conjecture both for the Inner Model Program and for understanding the limits of the large cardinal hierarchy. We show that if the HOD Conjecture is true then this provides strong evidence for the existence of an ultimate version of Gödel's constructible universe L. Whether or not this "ultimate" L exists is now arguably the central (...)
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Adding dependent choice.David Pincus - 1977 - Annals of Mathematical Logic 11 (1):105.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Small forcing makes any cardinal superdestructible.Joel David Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.
    Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal κ becomes superdestructible--any further <κ--closed forcing which adds a subset to κ will destroy the measurability, even the weak compactness, of κ. Nevertheless, after small forcing indestructible cardinals remain resurrectible, but never strongly resurrectible.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.
    Download  
     
    Export citation  
     
    Bookmark   153 citations  
  • Fragments of Martin's Maximum in generic extensions.Y. Yoshinobu & B. Konig - 2004 - Mathematical Logic Quarterly 50 (3):297.
    We show that large fragments of MM, e. g. the tree property and stationary reflection, are preserved by strongly -game-closed forcings. PFA can be destroyed by a strongly -game-closed forcing but not by an ω2-closed.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • In search of ultimate- L the 19th midrasha mathematicae lectures.W. Hugh Woodin - 2017 - Bulletin of Symbolic Logic 23 (1):1-109.
    We give a fairly complete account which first shows that the solution to the inner model problem for one supercompact cardinal will yield an ultimate version ofLand then shows that the various current approaches to inner model theory must be fundamentally altered to provide that solution.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • C. C. C. forcing without combinatorics.Alan H. Mekler - 1984 - Journal of Symbolic Logic 49 (3):830-832.
    c.c.c. posets are characterised in terms of N-generic conditions. This characterisation can be applied to get simple proofs of many facts about c.c.c. forcing including $\operatorname{Con}(MA + \neg CH)$.
    Download  
     
    Export citation  
     
    Bookmark   2 citations