Switch to: Citations

Add references

You must login to add references.
  1. On Extensions of Elementary Logic.Per Lindström - 1969 - Theoria 35 (1):1-11.
    Download  
     
    Export citation  
     
    Bookmark   109 citations  
  • Interpolation and definability in abstract logics.Finn V. Jensen - 1974 - Synthese 27 (1-2):251 - 257.
    A semantical definition of abstract logics is given. It is shown that the Craig interpolation property implies the Beth definability property, and that the Souslin-Kleene interpolation property implies the weak Beth definability property. An example is given, showing that Beth does not imply Souslin-Kleene.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Linear reasoning. A new form of the herbrand-Gentzen theorem.William Craig - 1957 - Journal of Symbolic Logic 22 (3):250-268.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • (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  
  • Maximality of Logic Without Identity.Guillermo Badia, Xavier Caicedo & Carles Noguera - 2024 - Journal of Symbolic Logic 89 (1):147-162.
    Lindström’s theorem obviously fails as a characterization of first-order logic without identity ( $\mathcal {L}_{\omega \omega }^{-} $ ). In this note, we provide a fix: we show that $\mathcal {L}_{\omega \omega }^{-} $ is a maximal abstract logic satisfying a weak form of the isomorphism property (suitable for identity-free languages and studied in [11]), the Löwenheim–Skolem property, and compactness. Furthermore, we show that compactness can be replaced by being recursively enumerable for validity under certain conditions. In the proofs, we (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Method in Proofs of Undefinability.K. L. de Bouvère - 1961 - Studia Logica 12:208-210.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Equality-free logic: the method of diagrams and preservation theorems.P. Dellunde - 1999 - Logic Journal of the IGPL 7 (6):717-732.
    In this article I prove preservation theorems for the positive and for the universal-existential fragment of equality-free logic. I give a systematic presentation of the method of diagrams for first-order languages without equality.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Sentences with finite models.C. J. Ash - 1975 - Mathematical Logic Quarterly 21 (1):401-404.
    Download  
     
    Export citation  
     
    Bookmark   1 citation