Switch to: References

Add citations

You must login to add citations.
  1. The Craig Interpolation Theorem in abstract model theory.Jouko Väänänen - 2008 - Synthese 164 (3):401-420.
    The Craig Interpolation Theorem is intimately connected with the emergence of abstract logic and continues to be the driving force of the field. I will argue in this paper that the interpolation property is an important litmus test in abstract model theory for identifying “natural,” robust extensions of first order logic. My argument is supported by the observation that logics which satisfy the interpolation property usually also satisfy a Lindström type maximality theorem. Admittedly, the range of such logics is small.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A guide to the identification of admissible sets above structures.John S. Schlipf - 1977 - Annals of Mathematical Logic 12 (2):151.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • A generalization of the Łoś–Tarski preservation theorem.Abhisekh Sankaran, Bharat Adsul & Supratik Chakraborty - 2016 - Annals of Pure and Applied Logic 167 (3):189-210.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Local definability theory.Gonzalo E. Reyes - 1970 - Annals of Mathematical Logic 1 (1):95-137.
  • Boolean models and infinitary first order languages.J. -P. Ressayre - 1973 - Annals of Mathematical Logic 6 (1):41.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Parametrization over inductive relations of a bounded number of variables.Gregory L. McColm - 1990 - Annals of Pure and Applied Logic 48 (2):103-134.
  • Game sentences and ultrapowers.Renling Jin & H. Jerome Keisler - 1993 - Annals of Pure and Applied Logic 60 (3):261-274.
    We prove that if is a model of size at most [kappa], λ[kappa] = λ, and a game sentence of length 2λ is true in a 2λ-saturated model ≡ , then player has a winning strategy for a related game in some ultrapower ΠD of . The moves in the new game are taken in the cartesian power λA, and the ultrafilter D over λ must be chosen after the game is played. By taking advantage of the expressive power of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations