52 search results - page 1 / 11 » Algorithmic correspondence and completeness in modal logic |
JANCL
2008
13 years 4 months ago
2008
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...
JAPLL
2010
13 years 3 months ago
2010
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...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
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...
POPL
2007
ACM
14 years 4 months ago
2007
ACM
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...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
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...