کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4663028 1345221 2010 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات منطق ریاضی
پیش نمایش صفحه اول مقاله
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 based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points FOμ. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid μ-calculus. In particular, we prove that the recursive extension of SQEMA succeeds on the class of ‘recursive formulae’. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Applied Logic - Volume 8, Issue 4, December 2010, Pages 319–333
نویسندگان
, , ,