Modal Boolean Connexive Logics: Semantics and Tableau Approach
Discussiones Mathematicae Graph Theory, Tome 48 (2019) no. 3.
Voir la notice de l'article dans Library of Science
In this paper we investigate Boolean connexive logics in a language with modal operators: □, ◊. In such logics, negation, conjunction, and disjunction behave in a classical, Boolean way. Only implication is non-classical. We construct these logics by mixing relating semantics with possible worlds. This way, we obtain connexive counterparts of basic normal modal logics. However, most of their traditional axioms formulated in terms of modalities and implication do not hold anymore without additional constraints, since our implication is weaker than the material one. In the final section, we present a tableau approach to the discussed modal logics.
Mots-clés :
Boolean connexive logics, connexive logic, modal Boolean connexive logics, modal logics, normal modal logics, possible worlds semantics, relatedness, relating logic, relating semantics, tableau methods
@article{DMGT_2019_48_3_a4, author = {Jarmu\.zek, Tomasz and Malinowski, Jacek}, title = {Modal {Boolean} {Connexive} {Logics:} {Semantics} and {Tableau} {Approach}}, journal = {Discussiones Mathematicae Graph Theory}, publisher = {mathdoc}, volume = {48}, number = {3}, year = {2019}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2019_48_3_a4/} }
TY - JOUR AU - Jarmużek, Tomasz AU - Malinowski, Jacek TI - Modal Boolean Connexive Logics: Semantics and Tableau Approach JO - Discussiones Mathematicae Graph Theory PY - 2019 VL - 48 IS - 3 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/DMGT_2019_48_3_a4/ LA - en ID - DMGT_2019_48_3_a4 ER -
Jarmużek, Tomasz; Malinowski, Jacek. Modal Boolean Connexive Logics: Semantics and Tableau Approach. Discussiones Mathematicae Graph Theory, Tome 48 (2019) no. 3. https://geodesic-test.mathdoc.fr/item/DMGT_2019_48_3_a4/