Modal Boolean Connexive Logics: Semantics and Tableau Approach
MetadataShow full item record
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.
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by-nc-nd/4.0
Showing items related by title, author, creator and subject.
Tomova, Natalya (Wydawnictwo Uniwersytetu Łódzkiego, 2020-11-13)In this paper, we consider the class of four-valued literal-paraconsistent-paracomplete logics constructed by combination of isomorphs of classical logic CPC. These logics form a 10-element upper semi-lattice with respect ...
Degauquier, Vincent (Wydawnictwo Uniwersytetu Łódzkiego, 2018)The temporal logic KtT4 is the modal logic obtained from the minimal temporal logic Kt by requiring the accessibility relation to be reflexive (which corresponds to the axiom T) and transitive (which corresponds to the ...
Robles, Gemma; López, Sandra M.; Blanco, José M.; Recio, Marcos M.; Paradela, Jesús R. (Wydawnictwo Uniwersytetu Łódzkiego, 2016)The logic BN4 can be considered as the 4-valued logic of the relevant conditional and the logic E4, as the 4-valued logic of (relevant) entailment. The aim of this paper is to endow E4 with a 2-set-up Routley-Meyer semantics. ...