A new proof of completeness for a relative modal logic with composition and intersection
نویسنده
چکیده
This paper is devoted to the completeness issue of RMLCI | the relative modal logic with composition and intersection | a restriction of the propositional dynamic logic with intersection. The trouble with RMLCI is that the operation of intersection is not modally deenable. Using the notion of mosaics, we give a new proof of a theorem considered in a previous paper \Complete axiomatization of a relative modal logic with composition and intersection". The theorem asserts that the proof theory of RMLCI is complete for the standard Kripke semantics of RMLCI.
منابع مشابه
A Canonical Model Construction for Iteration-Free PDL with Intersection
We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and tests makes its proof-theory rather difficult. We develop a normal form for formulae which minimises the interaction between these operators, as well as a refined canonical model construction. From these we derive an ax...
متن کاملComplete axiomatization of a relative modal logic with composition and intersection
We consider the question of the complete axiomatization of a relative modal logic with composition and intersection.
متن کامل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...
متن کاملCompleteness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
We study an extension of Hennessy-Milner logic for the π-calculus which gives a sound and complete characterisation of representative behavioural preorders and equivalences over typed processes. New connectives are introduced representing actual and hypothetical typed parallel composition and hiding. We study three compositional proof systems, characterising the May/Must testing preorders and b...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 11 شماره
صفحات -
تاریخ انتشار 2001