Add to ORKGIt is well known that no consistent normal modal logic contains (as theorems) both ◊A and ◊¬A (for any formula A). Here we observe that this claim can be strengthened to the following: for any formula A, either no consistent normal modal logic contains ◊A, or else no consistent normal modal logic contains ◊¬A
none2noThis paper introduces the logics of super-strict implications that are based on C.I. Lewis’ n...
International audienceFor the classical propositional logic SAT polynomially reduces to 3-SAT. In th...
What is the modal status of antinomies?ι Classical modal logic provides no interesting answer to thi...
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. We discuss two constructions of non-equivalent modal formulas for normal modal logics. One...
Kracht M, Wolter F. Normal modal logics can simulate all others. Journal of Symbolic Logic. 1999;64:...
In this paper the authors propose a method of verifying formulae in normal modal logics. In order to...
The modal logic literature is notorious for multiple axiomatisations of the same logic and for confl...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
This is the first, out of two papers, in which we identify all logics between C1 and S5 having the s...
International audienceWe present a coinductive definition of models for modal logics and show that i...
It is well known at present that relational semantics for propositional modal logics is far from com...
This is the second, out of two papers, in which we identify all logics between C1 and S5 having the ...
International audienceIt is already known that unifiable formulas in normal modal logic K + Box Box ...
none2noThis paper introduces the logics of super-strict implications that are based on C.I. Lewis’ n...
International audienceFor the classical propositional logic SAT polynomially reduces to 3-SAT. In th...
What is the modal status of antinomies?ι Classical modal logic provides no interesting answer to thi...
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. We discuss two constructions of non-equivalent modal formulas for normal modal logics. One...
Kracht M, Wolter F. Normal modal logics can simulate all others. Journal of Symbolic Logic. 1999;64:...
In this paper the authors propose a method of verifying formulae in normal modal logics. In order to...
The modal logic literature is notorious for multiple axiomatisations of the same logic and for confl...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
This is the first, out of two papers, in which we identify all logics between C1 and S5 having the s...
International audienceWe present a coinductive definition of models for modal logics and show that i...
It is well known at present that relational semantics for propositional modal logics is far from com...
This is the second, out of two papers, in which we identify all logics between C1 and S5 having the ...
International audienceIt is already known that unifiable formulas in normal modal logic K + Box Box ...
none2noThis paper introduces the logics of super-strict implications that are based on C.I. Lewis’ n...
International audienceFor the classical propositional logic SAT polynomially reduces to 3-SAT. In th...
What is the modal status of antinomies?ι Classical modal logic provides no interesting answer to thi...