Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the...