Canonical completeness of infinitary μ
نویسندگان
چکیده
This paper presents a new model construction for a natural cut-free infinitary version Kω (μ) of the propositional modal μ-calculus. Based on that the completeness of Kω (μ) and the related system Kω(μ) can be established directly – no detour, for example through automata theory, is needed. As a side result we also obtain a finite, cut-free sound and complete system for the propositional modal μ-calculus.
منابع مشابه
Cut–Free Axiomatizations for Stratified Modal Fixed Point Logic
We present an infinitary and a finitary cut–free axiomatization for a fragment of the modal μ–calculus in which nesting of fixed points is restricted to non–interleaving occurrences. In this study we prove soundness and completeness of both axiomatizations. Completeness is established by constructing a canonical countermodel to any non– provable formula using an extension of the method of satur...
متن کاملStrong completeness and limited canonicity for PDL and similar modal logics
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness (the property Γ |= φ ⇒ Γ ` φ) requires an infinitary proof system. In this paper, we present a short proof for strong completeness of PDL relative an infinitary proof system containing the rule from [α;βn]φ for all n ∈ N, conclude [α;β∗]φ. The proof uses a universal canonical model, and it is ge...
متن کاملA finite model theorem for the propositional μ-calculus
We prove a finite model theorem and infinitary completeness result for the propositional μ-calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of wellquasi-orders.
متن کاملOn the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes)
The subject of this thesis is the proof theory of logics with fixed points, such as the μ-calculus, linear-logic with fixed points, etc. These logics are usually equipped with finitary deductive systems that rely on Park’s rules for induction. other proof systems for these logics exist, which rely on infinitary proofs, but they are much less developped. This thesis contributes to reduce this de...
متن کاملOn the Completeness of Context-Sensitive Order-Sorted Specifications
We propose three different notions of completeness for term rewrite specifications supporting order-sorted signatures, deduction modulo axioms, and context-sensitive rewriting relative to a replacement map μ. Our three notions are: (1) an appropriate definition of μ-sufficient completeness with respect to a set of constructor symbols; (2) a definition of μ-canonical completeness under which μ-c...
متن کامل