We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
Harish Devarajan, Dominic J. D. Hughes, Gordon D. ...
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...