ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...
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...
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...