Logica Universalis 15 (4):517-536 (2021)
AbstractBoolean connexive logic is an extension of Boolean logic that is closed under Modus Ponens and contains Aristotle’s and Boethius’ theses. According to these theses a sentence cannot imply its negation and the negation of a sentence cannot imply the sentence; and if the antecedent implies the consequent, then the antecedent cannot imply the negation of the consequent and if the antecedent implies the negation of the consequent, then the antecedent cannot imply the consequent. Such a logic was first introduced by Jarmużek and Malinowski, by means of so-called relating semantics and tableau systems. Subsequently its modal extension was determined by means of the combination of possible-worlds semantics and relating semantics. In the following article we present axiomatic systems of some basic and modal Boolean connexive logics. Proofs of completeness will be carried out using canonical models defined with respect to maximal consistent sets.
Similar books and articles
Modal Boolean Connexive Logics: Semantics and Tableau Approach.Tomasz Jarmużek & Jacek Malinowski - 2019 - Bulletin of the Section of Logic 48 (3):213-243.
Connexive Restricted Quantification.Nissim Francez - 2020 - Notre Dame Journal of Formal Logic 61 (3):383-402.
Hyperboolean Algebras and Hyperboolean Modal Logic.Valentin Goranko & Dimiter Vakarelov - 1999 - Journal of Applied Non-Classical Logics 9 (2):345-368.
Boolean Conservative Extension Results for some Modal Relevant Logics.Edwin D. Mares & Koji Tanaka - 2011 - Australasian Journal of Logic 8 (5):31-49.
Boolean negation and non-conservativity I: Relevant modal logics.Tore Fjetland Øgaard - 2021 - Logic Journal of the IGPL 29 (3):340-362.
Constant Domain Quantified Modal Logics Without Boolean Negation.Greg Restall - 2005 - Australasian Journal of Logic 3:45-62.
Dynamic logics of the region-based theory of discrete spaces.Philippe Balbiani, Tinko Tinchev & Dimiter Vakarelov - 2007 - Journal of Applied Non-Classical Logics 17 (1):39-61.
A Note on Strong Axiomatization of Gödel Justification Logic.Nicholas Pischke - 2020 - Studia Logica 108 (4):687-724.
Unwinding Modal Paradoxes on Digraphs.Ming Hsiung - 2021 - Journal of Philosophical Logic 50 (2):319-362.
Variable Sharing in Connexive Logic.Luis Estrada-González & Claudia Lucía Tanús-Pimentel - 2021 - Journal of Philosophical Logic 50 (6):1377-1388.
Expressive power and semantic completeness: Boolean connectives in modal logic.I. L. Humberstone - 1990 - Studia Logica 49 (2):197 - 214.
Completeness and conservative extension results for some Boolean relevant logics.Steve Giambrone & Robert K. Meyer - 1989 - Studia Logica 48 (1):1 - 14.
Modal logics with Belnapian truth values.Serge P. Odintsov & Heinrich Wansing - 2010 - Journal of Applied Non-Classical Logics 20 (3):279-304.
On modal logics characterized by models with relative accessibility relations: Part I.Stéphane Demri & Dov Gabbay - 2000 - Studia Logica 65 (3):323-353.
Boolean negation and non-conservativity II: The variable-sharing property.Tore Fjetland Øgaard - 2021 - Logic Journal of the IGPL 29 (3):363-369.
Added to PP
Historical graph of downloads
References found in this work
No references found.