Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Grades of Discrimination: Indiscernibility, Symmetry, and Relativity.Tim Button - 2017 - Notre Dame Journal of Formal Logic 58 (4):527-553.
    There are several relations which may fall short of genuine identity, but which behave like identity in important respects. Such grades of discrimination have recently been the subject of much philosophical and technical discussion. This paper aims to complete their technical investigation. Grades of indiscernibility are defined in terms of satisfaction of certain first-order formulas. Grades of symmetry are defined in terms of symmetries on a structure. Both of these families of grades of discrimination have been studied in some detail. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A survey of abstract algebraic logic.J. M. Font, R. Jansana & D. Pigozzi - 2003 - Studia Logica 74 (1-2):13 - 97.
    Download  
     
    Export citation  
     
    Bookmark   114 citations  
  • Categorical abstract algebraic logic: The Diagram and the Reduction Operator Lemmas.George Voutsadakis - 2007 - Mathematical Logic Quarterly 53 (2):147-161.
    The study of structure systems, an abstraction of the concept of first-order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of the expansion of a first-order structure by constants is presented. Furthermore, analogs of the Diagram Lemma and the Reduction Operator Lemma from the theory of equality-free first-order structures are provided in the framework of structure systems. (© 2007 WILEY-VCH (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • First-Order Friendliness.Guillermo Badia & David Makinson - forthcoming - Review of Symbolic Logic:1-15.
    In this note we study a counterpart in predicate logic of the notion of logical friendliness, introduced into propositional logic in [15]. The result is a new consequence relation for predicate languages with equality using first-order models. While compactness, interpolation and axiomatizability fail dramatically, several other properties are preserved from the propositional case. Divergence is diminished when the language does not contain equality with its standard interpretation.
    Download  
     
    Export citation  
     
    Bookmark   1 citation