Sciweavers

JAPLL
2010
131views more  JAPLL 2010»
13 years 3 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
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...
JANCL
2008
170views more  JANCL 2008»
13 years 4 months ago
Algorithmic correspondence and completeness in modal logic
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...
Willem Conradie, Valentin Goranko