Switch to: Citations

Add references

You must login to add references.
  1. Definability hierarchies of general quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.
  • Isomorphism and higher order equivalence.M. Ajtai - 1979 - Annals of Mathematical Logic 16 (3):181.
  • A Δ22 well-order of the reals and incompactness of L.Uri Abraham & Saharon Shelah - 1993 - Annals of Pure and Applied Logic 59 (1):1-32.
    A forcing poset of size 221 which adds no new reals is described and shown to provide a Δ22 definable well-order of the reals . The encoding of this well-order is obtained by playing with products of Aronszajn trees: some products are special while other are Suslin trees. The paper also deals with the Magidor–Malitz logic: it is consistent that this logic is highly noncompact.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • A Δ< sup> 2< sub> 2 well-order of the reals and incompactness of< i> L(< i> QMM).Uri Abraham & Saharon Shelah - 1993 - Annals of Pure and Applied Logic 59 (1):1-32.
  • The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal.W. Hugh Woodin - 2002 - Bulletin of Symbolic Logic 8 (1):91-93.
  • Second order logic or set theory?Jouko Väänänen - 2012 - Bulletin of Symbolic Logic 18 (1):91-121.
    We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be in manifest conflict with each (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  • Consistency results about ordinal definability.Kenneth McAloon - 1971 - Annals of Mathematical Logic 2 (4):449.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  • Iteration Trees.D. A. Martin & J. R. Steel - 2002 - Bulletin of Symbolic Logic 8 (4):545-546.
  • Martin’s Maximum and definability in H.Paul B. Larson - 2008 - Annals of Pure and Applied Logic 156 (1):110-122.
    In [P. Larson, Martin’s Maximum and the axiom , Ann. Pure App. Logic 106 135–149], we modified a coding device from [W.H. Woodin, The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal, Walter de Gruyter & Co, Berlin, 1999] and the consistency proof of Martin’s Maximum from [M. Foreman, M. Magidor, S. Shelah, Martin’s Maximum. saturated ideals, and non-regular ultrafilters. Part I, Annal. Math. 127 1–47] to show that from a supercompact limit of supercompact cardinals one could force Martin’s (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • PFA Implies ADL(R).John R. Steel - 2005 - Journal of Symbolic Logic 70 (4):1255 - 1296.
  • Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   120 citations  
  • Completeness in the theory of types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
  • Long projective wellorderings.Leo Harrington - 1977 - Annals of Mathematical Logic 12 (1):1.
  • Model-Theoretic Logics.Jon Barwise & Solomon Feferman - 2017 - Cambridge University Press.
    This book brings together several directions of work in model theory between the late 1950s and early 1980s.
    Direct download  
     
    Export citation  
     
    Bookmark   65 citations  
  • Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
     
    Export citation  
     
    Bookmark   323 citations