Sahlqvist Correspondence for Modal mu-calculus
نویسندگان
چکیده
We define analogues of modal Sahlqvist formulas for the modal mucalculus, and prove a correspondence theorem for them.
منابع مشابه
Order theoretic Correspondence theory for Intuitionistic mu-calculus
Sahlqvist correspondence theory [3], [4] is one of the most important and useful results of classical modal logic. It gives a syntactic identification of a class of modal formulas whose associated normal modal logics are strongly complete with respect to elementary (i.e. first-order definable) classes of frames. Every Sahlqvist formula is both canonical and corresponds to some elementary frame ...
متن کاملfor modal mu - calculus
We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus, Part 1
Modal mu-calculus [5] is a logical framework combining simple modalities with fixed point operators, enriching the expressivity of modal logic so as to deal with infinite processes like recursion. It has a simple syntax, an easily given semantics, and is decidable. Many expressive modal and temporal logics such as PDL, CTL and CTL∗ can be seen as fragments of the modal mu-calculus. Sahlqvist-st...
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus, Part 2
Sahlqvist-style correspondence results remain a perennial theme and an active topic of research within modal logic. Recently, there has been interest in extending the classical results in this area to the modal mu-calculus [7]. For instance, in [8] van Benthem, Bezhanishvili and Hodkinson define a class of Sahlqvist formulas for the modal mu-calculus, all of which have frame correspondents in f...
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus
In the present paper, the algorithmic correspondence theory developed in (Conradie and Palmigiano, 2012) is extended to mu-calculi with a non-classical base. We focus in particular on the language of bi-intuitionistic modal mu-calculus. We enhance the algorithm ALBA introduced in (Conradie and Palmigiano, 2012) so as to guarantee its success on the class of recursive muinequalities, which we in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 100 شماره
صفحات -
تاریخ انتشار 2012