12 found
Order:
Disambiguations
Lee J. Stanley [8]Lee Stanley [7]
  1.  25
    Daniel J. Velleman, Morasses, Diamond, and Forcing, Annals of Mathematical Logic, Vol. 23 , Pp. 199–281. - Dan Velleman. On a Generalization of Jensen's □Κ, and Strategic Closure of Partial Orders, The Journal of Symbolic Logic, Vol. 48, No. 4 , Pp. 1046–1052. [REVIEW]Lee Stanley - 1989 - Journal of Symbolic Logic 54 (2):639-646.
  2.  28
    A Borel Reducibility Theory for Classes of Countable Structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
    We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to class). Though we sometimes work in a slightly larger context, we are principally concerned with the case where each class is an invariant Borel class (i.e. the class of all models, with underlying set $= \omega$, of an $L_{\omega_1\omega}$ sentence; from this point of view, the reducibility can be thought of as a (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  3.  17
    Keith J. Devlin. Constructibility. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1984, Xi + 425 Pp. [REVIEW]Lee J. Stanley - 1987 - Journal of Symbolic Logic 52 (3):864-867.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  3
    A Theorem and Some Consistency Results in Partition Calculus.Saharon Shelah & Lee Stanley - 1987 - Annals of Pure and Applied Logic 36 (2):119-152.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  5.  10
    Condensation-Coherent Global Square Systems.Hans-Dieter Donder, Ronald B. Jensen & Lee J. Stanley - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--237.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  38
    Filters, Cohen Sets and Consistent Extensions of the Erdös-Dushnik-Miller Theorem.Saharon Shelah & Lee J. Stanley - 2000 - Journal of Symbolic Logic 65 (1):259-271.
    We present two different types of models where, for certain singular cardinals λ of uncountable cofinality, λ → (λ,ω + 1) 2 , although λ is not a strong limit cardinal. We announce, here, and will present in a subsequent paper, [7], that, for example, consistently, $\aleph_{\omega_1} \nrightarrow (\aleph_{\omega_1}, \omega + 1)^2$ and consistently, 2 $^{\aleph_0} \nrightarrow (2^{\aleph_0},\omega + 1)^2$.
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark  
  7.  4
    [Omnibus Review].Lee Stanley - 1989 - Journal of Symbolic Logic 54 (2):639-646.
  8.  23
    Forcing Many Positive Polarized Partition Relations Between a Cardinal and its Powerset.Saharon Shelah & Lee J. Stanley - 2001 - Journal of Symbolic Logic 66 (3):1359-1370.
    A fairly quotable special, but still representative, case of our main result is that for 2 ≤ n ≤ ω, there is a natural number m (n) such that, the following holds. Assume GCH: If $\lambda are regular, there is a cofinality preserving forcing extension in which 2 λ = μ and, for all $\sigma such that η +m(n)-1) ≤ μ, ((η +m(n)-1) ) σ ) → ((κ) σ ) η (1)n . This generalizes results of [3], Section 1, and (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  9.  13
    Characterizing Weak Compactness.Lee J. Stanley - 1984 - Annals of Pure and Applied Logic 26 (1):89-99.
  10.  11
    Review: Keith J. Devlin, Constructibility. [REVIEW]Lee J. Stanley - 1987 - Journal of Symbolic Logic 52 (3):864-867.
  11.  18
    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.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  12.  16
    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.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark