Switch to: References

Add citations

You must login to add citations.
  1. Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Expansions of models of ω-stable theories.Steven Buechler - 1984 - Journal of Symbolic Logic 49 (2):470-477.
    We prove that every relation-universal model of an ω-stable theory is saturated. We also show there is a large class of ω-stable theories for which every resplendent model is homogeneous.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Defining algebraic elements.Paul D. Bacsich - 1973 - Journal of Symbolic Logic 38 (1):93-101.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Syntactic characterisations of amalgamation, convexity and related properties.Paul D. Bacsich & Dafydd Rowlands Hughes - 1974 - Journal of Symbolic Logic 39 (3):433-451.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Game sentences, recursive saturation and definability.Victor Harnik - 1980 - Journal of Symbolic Logic 45 (1):35-46.
    Download  
     
    Export citation  
     
    Bookmark  
  • Weak definability in infinitary languages.Saharon Shelah - 1973 - Journal of Symbolic Logic 38 (3):399-404.
    We shall prove that if a model of cardinality κ can be expanded to a model of a sentence ψ of Lλ+,ω by adding a suitable predicate in more than κ ways, then, it has a submodel of power μ which can be expanded to a model of ψ in $> \mu$ ways provided that λ,κ,μ satisfy suitable conditions.
    Download  
     
    Export citation  
     
    Bookmark  
  • Generalized interpolation theorems.Stephen J. Garland - 1972 - Journal of Symbolic Logic 37 (2):343-351.
    Download  
     
    Export citation  
     
    Bookmark  
  • Constituents and finite identifiability.Jaakko Hintikka - 1972 - Journal of Philosophical Logic 1 (1):45 - 52.
    Download  
     
    Export citation  
     
    Bookmark   2 citations