Abstract: Various connexive FDE-based modal logics are studied. Some of these logics contain a conditional that is both connexive and strict, thereby highlighting that strictness and connexivity of a conditional do not exclude each other. In particular, the connexive modal logics cBK -, cKN4, scBK -, scKN4, cMBL, and scMBL are introduced semantically by means of classes of Kripke models. The logics cBK - and cKN4 are connexive variants of the FDE-based modal logics BK - and KN4 with a weak and a strong implication, respectively. The system cMBL is a connexive variant of the modal bilattice logic MBL. The latter is a modal extension of Arieli and Avron’s logic of logical bilattices and is characterized by a class of Kripke models with a four-valued accessibility relation. In the systems scBK -, scKN4, and scMBL, the conditional is both connexive and strict. Sound and complete tableau calculi for all these logics are presented and used to show that the entailment relations of the systems under consideration are decidable for finite premise set. Moreover, the logics cBK- and cMBL are shown to be algebraizable. The algebraizability of cMBL is derived from proving cMBL to be definitionally equivalent to MBL. All connexive modal logics studied in this paper are decidable, paraconsistent, and inconsistent but non-trivial logics.

Cite: Odintsov S. , Skurt D. , Wansing H.
Connexive Variants of Modal Logics Over FDE
Outstanding Contributions to Logic. 2021. V.21. P.295 - 318. DOI: 10.1007/978-3-030-71258-7_13 Scopus OpenAlex

Identifiers:

Scopus:	2-s2.0-85111984471
OpenAlex:	W3187663745

Citing:

DB	Citing
Scopus	3
OpenAlex	7

Altmetrics: