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. ...

This note offers a non-deterministic semantics for mbC1, introduced by Janusz Ciuciura, and establishes soundness and (strong) completeness results with respect to the Hilbert-style proof system. Moreover, based on the new ...

We present three examples of topological semantics for intuitionistic modal logic with one modal operator □. We show that it is possible to treat neighborhood models, introduced earlier, as topological or multi-topological. ...

Even if a lattice L is not distributive, it is still possible that for particular elements x, y, z ∈ L it holds (x∨y) ∧z = (x∧z) ∨ (y ∧z). If this is the case, we say that the triple (x, y, z) is distributive. In this note ...

As a generation of fuzzy set, the notion of complex fuzzy set which is an innovative concept is introduced by Ramot, Milo, Friedman and Kandel. The purpose of this article is to apply complex fuzzy set to BCK/BCI-algebras. ...