Abstract. We discuss two constructions of non-equivalent modal formulas for normal modal logics. One is basically same as the dual of the construction in Moss [Mos07] and the other is the construction in [Sas05], [Sas08] and [Sas09]. The former is useful for any normal modal logics, while as in [Sas09], the latter has much more information for modal logic S4. Here we define two constructions in sequent style and discuss the difference between them.
The modal logic literature is notorious for multiple axiomatizations of the same logic and for confl...
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a ...
International audienceFor the classical propositional logic SAT polynomially reduces to 3-SAT. In th...
The modal logic literature is notorious for multiple axiomatisations of the same logic and for confl...
We present a general proof method for normal systems of modal predicate logic with identical inferen...
We present a general proof method for normal systems of modal predicate logic with identical inferen...
Abstract. The paper provides a preliminary study of algebraic semantics for normal modal non-monoton...
It is well known that no consistent normal modal logic contains (as theorems) both ◊A and ◊¬A (for a...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
A general procedure that follows the guidelines of inferentialism is presented for generating G3-sty...
We present a family of minimal modal logics (namely, modal logics based on minimal propositional log...
In this paper, a modular approach for non-deterministic semantics for (non-normal) modal logics is d...
International audienceThe classical cube of non-normal modal logics is considered, and an alternativ...
This paper shows that non–normal modal logics can be simulated by certain polymodal normal logics an...
The modal logic literature is notorious for multiple axiomatizations of the same logic and for confl...
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a ...
International audienceFor the classical propositional logic SAT polynomially reduces to 3-SAT. In th...
The modal logic literature is notorious for multiple axiomatisations of the same logic and for confl...
We present a general proof method for normal systems of modal predicate logic with identical inferen...
We present a general proof method for normal systems of modal predicate logic with identical inferen...
Abstract. The paper provides a preliminary study of algebraic semantics for normal modal non-monoton...
It is well known that no consistent normal modal logic contains (as theorems) both ◊A and ◊¬A (for a...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
A general procedure that follows the guidelines of inferentialism is presented for generating G3-sty...
We present a family of minimal modal logics (namely, modal logics based on minimal propositional log...
In this paper, a modular approach for non-deterministic semantics for (non-normal) modal logics is d...
International audienceThe classical cube of non-normal modal logics is considered, and an alternativ...
This paper shows that non–normal modal logics can be simulated by certain polymodal normal logics an...
The modal logic literature is notorious for multiple axiomatizations of the same logic and for confl...
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a ...
International audienceFor the classical propositional logic SAT polynomially reduces to 3-SAT. In th...