Completeness for Coalgebraic Fixpoint Logic
نویسندگان
چکیده
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema as a generalization, based on Moss’ coalgebraic modality, of the well-known modal mucalculus. Our axiomatization can be seen as a generalization of Kozen’s proof system for the modal mu-calculus to the coalgebraic level of generality. It consists of a complete axiomatization for Moss’ modality, extended with Kozen’s axiom and rule for the fixpoint operators. Our main result is a completeness theorem stating that, for functors that preserve weak pullbacks and restrict to finite sets, our axiomatization is sound and complete for the standard interpretation of the language in coalgebraic models. Our proof is based on automata-theoretic ideas: in particular, we introduce the notion of consequence game for modal automata, which plays a crucial role in the proof of our main result. The result generalizes the celebrated Kozen-Walukiewicz completeness theorem for the modal mu-calculus, and our automata-theoretic methods simplify parts of Walukiewicz’ proof. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Disjunctive bases: normal forms and model theory for modal logics
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it m...
متن کاملDisjunctive Bases: Normal Forms for Modal Logics
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it m...
متن کامل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...
متن کاملUniform Interpolation for Coalgebraic Fixpoint Logic
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely closure under projection, which is known to hold for weak-pullback preserving functors, to a more general class of functors, i.e.; functors with quasi-functorial...
متن کاملEXPTIME Tableaux for the Coalgebraic µ-Calculus
The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this paper, we introduce the coalgebraic μ-calculus, an extension of the general (coalgebraic) framework with fixpoint operators. Our main results are completeness of...
متن کامل