Switch to: References

Add citations

You must login to add citations.
  1. Pointwise definable models of set theory.Joel David Hamkins, David Linetsky & Jonas Reitz - 2013 - Journal of Symbolic Logic 78 (1):139-156.
    A pointwise definable model is one in which every object is \loos definable without parameters. In a model of set theory, this property strengthens $V=\HOD$, but is not first-order expressible. Nevertheless, if \ZFC\ is consistent, then there are continuum many pointwise definable models of \ZFC. If there is a transitive model of \ZFC, then there are continuum many pointwise definable transitive models of \ZFC. What is more, every countable model of \ZFC\ has a class forcing extension that is pointwise definable. (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Some recent developments in higher recursion theory.Sy D. Friedman - 1983 - Journal of Symbolic Logic 48 (3):629-642.
    In recent years higher recursion theory has experienced a deep interaction with other areas of logic, particularly set theory (fine structure, forcing, and combinatorics) and infinitary model theory. In this paper we wish to illustrate this interaction by surveying the progress that has been made in two areas: the global theory of the κ-degrees and the study of closure ordinals.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Coding over a measurable cardinal.Sy D. Friedman - 1989 - Journal of Symbolic Logic 54 (4):1145-1159.
    Download  
     
    Export citation  
     
    Bookmark  
  • A guide to "coding the universe" by Beller, Jensen, Welch.Sy D. Friedman - 1985 - Journal of Symbolic Logic 50 (4):1002-1019.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)A very absolute Pi-1-2 real singleton.René David - 1982 - Annals of Mathematical Logic 23 (2-3):101-120.
    I give a class forcing that adds a real which is Pi-1-2 and for which no forcing extension (by a set of conditions) can destroy this definability.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)A very absolute Π21 real singleton.René David - 1982 - Annals of Mathematical Logic 23 (2-3):101-120.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Generic absoluteness.Joan Bagaria & Sy D. Friedman - 2001 - Annals of Pure and Applied Logic 108 (1-3):3-13.
    We explore the consistency strength of Σ 3 1 and Σ 4 1 absoluteness, for a variety of forcing notions.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)Generic absoluteness.Joan Bagaria & Sy Friedman - 2001 - Annals of Pure and Applied Logic 108 (1-3):3-13.
    We explore the consistency strength of Σ31 and Σ41 absoluteness, for a variety of forcing notions.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Iterating ordinal definability.Wlodzimierz Zadrozny - 1983 - Annals of Mathematical Logic 24 (3):263-310.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A combinatorial forcing for coding the universe by a real when there are no sharps.Saharon Shelah & Lee J. Stanley - 1995 - Journal of Symbolic Logic 60 (1):1-35.
    Assuming 0 ♯ does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the Covering Lemma, in various guises), but makes no direct appeal to fine structure itself.
    Download  
     
    Export citation  
     
    Bookmark  
  • The combinatorics of combinatorial coding by a real.Saharon Shelah & Lee J. Stanley - 1995 - Journal of Symbolic Logic 60 (1):36-57.
    We lay the combinatorial foundations for [5] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
    Download  
     
    Export citation  
     
    Bookmark