On modal mu-calculus in S5 and applications
نویسندگان
چکیده
We show that the vectorial μ-calculus model checking problem over arbitrary graphs reduces to the vectorial, existential μ-calculus model checking problem over S5 graphs. We also draw some consequences of this fact. Moreover, we give a proof that satisfiability of μ-calculus in S5 is NP -complete, and by using S5 graphs we give a new proof that the satisfiability problem of the existential μ-calculus is also NP -complete.
منابع مشابه
Completeness for μ-calculi: a coalgebraic approach
We set up a generic framework for proving completeness results for variants of the modal mucalculus, using tools from coalgebraic modal logic. We illustrate the method by proving two new completeness results: for the graded mu-calculus (which is equivalent to monadic second-order logic on the class of unranked tree models), and for the monotone modal mu-calculus. Besides these main applications...
متن کامل0 N ov 2 01 7 A Cut - free sequent calculus for modal logic S 5 ∗ †
Providing a cut-free sequent calculus for S5 has a long history. The efforts in this direction are numerous, and each of them presents some difficulties. In this paper, we present a sequent calculus system for modal logic S5. It has in a sense subformula property. We show that the cut rule is admissible in this system.
متن کاملClassical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination, we obtain a cut-elimination theorem for all corresponding CoS calculi. We then show how our result leads to a minimal cut-free CoS calculus for modal logic S5. No other existing CoS calculi for S5 e...
متن کاملSequent Calculi for the Modal µ-Calculus over S5
We present two sequent calculi for the modal μ-calculus over S5 and prove their completeness by using classical methods. One sequent calculus has an analytical cut rule and could be used for a decision procedure the other uses a modified version of the induction rule. We also provide a completeness theorem for Kozen’s Axiomatisation over S5 without using the completeness result established by W...
متن کاملSimple Decision Procedure for S5 in Standard Cut-free Sequent Calculus
In the paper a decision procedure for S5 is presented which uses a cut-free sequent calculus with additional rules allowing a reduction to normal modal forms. It utilizes the fact that in S5 every formula is equivalent to some 1-degree formula, i.e. a modally-flat formula with modal functors having only boolean formulas in its scope. In contrast to many sequent calculi (SC) for S5 the presented...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011