Switch to: References

Add citations

You must login to add citations.
  1. Polarity Semantics for Negation as a Modal Operator.Yuanlei Lin & Minghui Ma - 2020 - Studia Logica 108 (5):877-902.
    The minimal weakening \ of Belnap-Dunn logic under the polarity semantics for negation as a modal operator is formulated as a sequent system which is characterized by the class of all birelational frames. Some extensions of \ with additional sequents as axioms are introduced. In particular, all three modal negation logics characterized by a frame with a single state are formalized as extensions of \. These logics have the finite model property and they are decidable.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  • Varieties of Positive Modal Algebras and Structural Completeness.Tommaso Moraschini - 2019 - Review of Symbolic Logic 12 (3):557-588.
    Positive modal algebras are the$$\left\langle { \wedge, \vee,\diamondsuit,\square,0,1} \right\rangle $$-subreducts of modal algebras. We prove that the variety of positive S4-algebras is not locally finite. On the other hand, the free one-generated positive S4-algebra is shown to be finite. Moreover, we describe the bottom part of the lattice of varieties of positive S4-algebras. Building on this, we characterize structurally complete varieties of positive K4-algebras.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Epimorphisms, Definability and Cardinalities.T. Moraschini, J. G. Raftery & J. J. Wannenburg - 2020 - Studia Logica 108 (2):255-275.
    We characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures. This allows us to strengthen a result of Bacsich, as follows: in any prevariety having at most \ non-logical symbols and an axiomatization requiring at most \ variables, if the epimorphisms into structures with at most \ elements are surjective, then so are all of the epimorphisms. Using these facts, we formulate and prove manageable ‘bridge theorems’, matching the surjectivity of all epimorphisms in (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  • Countably Many Weakenings of Belnap–Dunn Logic.Minghui Ma & Yuanlei Lin - 2020 - Studia Logica 108 (2):163-198.
    Every Berman’s variety \ which is the subvariety of Ockham algebras defined by the equation \ and \) determines a finitary substitution invariant consequence relation \. A sequent system \ is introduced as an axiomatization of the consequence relation \. The system \ is characterized by a single finite frame \ under the frame semantics given for the formal language. By the duality between frames and algebras, \ can be viewed as a \-valued logic as it is characterized by a (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  • Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics.Adam Přenosil - 2017 - Studia Logica 105 (6):1255-1289.
    We develop a Gentzen-style proof theory for super-Belnap logics, expanding on an approach initiated by Pynko. We show that just like substructural logics may be understood proof-theoretically as logics which relax the structural rules of classical logic but keep its logical rules as well as the rules of Identity and Cut, super-Belnap logics may be seen as logics which relax Identity and Cut but keep the logical rules as well as the structural rules of classical logic. A generalization of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Gentzen Relations Associated with Finite-Valued Logics Preserving Degrees of Truth.Angel J. Gil - 2013 - Studia Logica 101 (4):749-781.
    When considering m-sequents, it is always possible to obtain an m-sequent calculus VL for every m-valued logic (defined from an arbitrary finite algebra L of cardinality m) following for instance the works of the Vienna Group for Multiple-valued Logics. The Gentzen relations associated with the calculi VL are always finitely equivalential but might not be algebraizable. In this paper we associate an algebraizable 2-Gentzen relation with every sequent calculus VL in a uniform way, provided the original algebra L has a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Algebraizable Logics with a Strong Conjunction and Their Semi-Lattice Based Companions.Ramon Jansana - 2012 - Archive for Mathematical Logic 51 (7-8):831-861.
    The best known algebraizable logics with a conjunction and an implication have the property that the conjunction defines a meet semi-lattice in the algebras of their algebraic counterpart. This property makes it possible to associate with them a semi-lattice based deductive system as a companion. Moreover, the order of the semi-lattice is also definable using the implication. This makes that the connection between the properties of the logic and the properties of its semi-lattice based companion is strong. We introduce a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Beyond Rasiowa's Algebraic Approach to Non-Classical Logics.Josep Maria Font - 2006 - Studia Logica 82 (2):179-209.
    This paper reviews the impact of Rasiowa's well-known book on the evolution of algebraic logic during the last thirty or forty years. It starts with some comments on the importance and influence of this book, highlighting some of the reasons for this influence, and some of its key points, mathematically speaking, concerning the general theory of algebraic logic, a theory nowadays called Abstract Algebraic Logic. Then, a consideration of the diverse ways in which these key points can be generalized allows (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Algebraic Proof Theory for Substructural Logics: Cut-Elimination and Completions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2012 - Annals of Pure and Applied Logic 163 (3):266-290.
  • On Substructural Logics Preserving Degrees of Truth.Josep Maria Font - 2007 - Bulletin of the Section of Logic 36 (3/4):117-129.
  • On the Complexity of the Leibniz Hierarchy.Tommaso Moraschini - 2019 - Annals of Pure and Applied Logic 170 (7):805-824.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • An Abstract Approach to Consequence Relations.Petr Cintula, José Gil-férez, Tommaso Moraschini & Francesco Paoli - 2019 - Review of Symbolic Logic 12 (2):331-371.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • M-Sets and the Representation Problem.Josep Maria Font & Tommaso Moraschini - 2015 - Studia Logica 103 (1):21-51.
    The “representation problem” in abstract algebraic logic is that of finding necessary and sufficient conditions for a structure, on a well defined abstract framework, to have the following property: that for every structural closure operator on it, every structural embedding of the expanded lattice of its closed sets into that of the closed sets of another structural closure operator on another similar structure is induced by a structural transformer between the base structures. This question arose from Blok and Jónsson abstract (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Representations of Structural Closure Operators.José Gil-Férez - 2011 - Archive for Mathematical Logic 50 (1-2):45-73.
    We continue the work of Blok and Jónsson by developing the theory of structural closure operators and introducing the notion of a representation between them. Similarities and equivalences of Blok-Jónsson turn out to be bijective representations and bijective structural representations, respectively. We obtain a characterization for representations induced by a transformer. In order to obtain a similar characterization for structural representations we introduce the notions of a graduation and a graded variable of an M-set. We show that several deductive systems, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • An Order-Theoretic Analysis of Interpretations Among Propositional Deductive Systems.Ciro Russo - 2013 - Annals of Pure and Applied Logic 164 (2):112-130.
    In this paper we study interpretations and equivalences of propositional deductive systems by using a quantale-theoretic approach introduced by Galatos and Tsinakis. Our aim is to provide a general order-theoretic framework which is able to describe and characterize both strong and weak forms of interpretations among propositional deductive systems also in the cases where the systems have different underlying languages.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Order algebraizable logics.James G. Raftery - 2013 - Annals of Pure and Applied Logic 164 (3):251-283.
    This paper develops an order-theoretic generalization of Blok and Pigozziʼs notion of an algebraizable logic. Unavoidably, the ordered model class of a logic, when it exists, is not unique. For uniqueness, the definition must be relativized, either syntactically or semantically. In sentential systems, for instance, the order algebraization process may be required to respect a given but arbitrary polarity on the signature. With every deductive filter of an algebra of the pertinent type, the polarity associates a reflexive and transitive relation (...)
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   8 citations  
  • The Semantic Isomorphism Theorem in Abstract Algebraic Logic.Tommaso Moraschini - 2016 - Annals of Pure and Applied Logic 167 (12):1298-1331.