Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

Details Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

2006-02-07

arxiv.org/abs/cs/0602024v4

LMCS 2 (1:5) 2006

Computer Science

Logic in Computer Science

26 pages, no figures, to appear in the Logical Methods in Computer Science

Scientific paper

10.2168/LMCS-2(1:5)2006

Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons. On the other hand, canonicity of modal formulae is important, too, because it implies frame-completeness of logics axiomatized with canonical formulae. Computing a first-order equivalent of a modal formula amounts to elimination of second-order quantifiers. Two algorithms have been developed for second-order quantifier elimination: SCAN, based on constraint resolution, and DLS, based on a logical equivalence established by Ackermann. In this paper we introduce a new algorithm, SQEMA, for computing first-order equivalents (using a modal version of Ackermann's lemma) and, moreover, for proving canonicity of modal formulae. Unlike SCAN and DLS, it works directly on modal formulae, thus avoiding Skolemization and the subsequent problem of unskolemization. We present the core algorithm and illustrate it with some examples. We then prove its correctness and the canonicity of all formulae on which the algorithm succeeds. We show that it succeeds not only on all Sahlqvist formulae, but also on the larger class of inductive formulae, introduced in our earlier papers. Thus, we develop a purely algorithmic approach to proving canonical completeness in modal logic and, in particular, establish one of the most general completeness results in modal logic so far.

Affiliated with

Also associated with

No associations

Rating

Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63152