Add to ORKGIn this paper the authors propose a method of verifying formulae in normal modal logics. In order to show that a formula α is a thesis of a normal modal logic, a set of decomposition rules for any formula is given. These decomposition rules are based on the symbols of assertion and rejection of formulae
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Kracht M, Wolter F. Normal modal logics can simulate all others. Journal of Symbolic Logic. 1999;64:...
This chapter analyzes the development of modal logic within the research framework formulated for a ...
AbstractIn the proof-theoretic study of logic, the notion of normal proof has been understood and in...
It is well known at present that relational semantics for propositional modal logics is far from com...
In the present paper I aim at providing a general framework to prove Kripke-completeness for normal ...
AbstractIn this paper a new proof procedure for some propositional and first-order normal modal logi...
International audienceThis article presents our work toward a rigorous experimental comparison of st...
The modal logic literature is notorious for multiple axiomatisations of the same logic and for confl...
The authors consider some computational properties of intuitionistic 2-sequent calculus [see A. Masi...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Kracht M, Wolter F. Normal modal logics can simulate all others. Journal of Symbolic Logic. 1999;64:...
This chapter analyzes the development of modal logic within the research framework formulated for a ...
AbstractIn the proof-theoretic study of logic, the notion of normal proof has been understood and in...
It is well known at present that relational semantics for propositional modal logics is far from com...
In the present paper I aim at providing a general framework to prove Kripke-completeness for normal ...
AbstractIn this paper a new proof procedure for some propositional and first-order normal modal logi...
International audienceThis article presents our work toward a rigorous experimental comparison of st...
The modal logic literature is notorious for multiple axiomatisations of the same logic and for confl...
The authors consider some computational properties of intuitionistic 2-sequent calculus [see A. Masi...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Kracht M, Wolter F. Normal modal logics can simulate all others. Journal of Symbolic Logic. 1999;64:...
This chapter analyzes the development of modal logic within the research framework formulated for a ...