Craig Interpolation of PDL
نویسندگان
چکیده
It seems to be an open question whether Propositional Dynamic Logic (PDL) has Craig Interpolation. In fact, it even seems to be an open question if this is an open question: Multiple proofs have been claimed to be found but all of them also have been claimed to be wrong, both more or less publicly. This report tries to clarify the situation by discussing the proof by Daniel Leivant [11] from 1981 in detail, trying to explain the main methods and ideas. In particular we defend the proof against a criticism expressed by Marcus Kracht [8] that Leivant’s proof would only show Craig Interpolation for finitary variants of PDL. We then try to reproduce the proof and argue that it is correct. Additionally, we show some basic results about PDL and finitary variants.
منابع مشابه
Practical Magick with C, PDL, and PDL: : PP - a guide to compiled add-ons for PDL
Preface This guide is intended to knit together, and extend, the existing PP and C documentation on PDL internals. It draws heavily from prior work by the authors of the code. Special thanks go to Christian Soeller, and Tuomas Lukka, who together with Glazebrook conceived and implemented PDL and PP; and to Chris Marshall, who has led the PDL development team through several groundbreaking relea...
متن کاملTableaux for Dynamic Logic of Propositional Assignments
The Dynamic Logic for Propositional Assignments (DL-PA) has recently been studied as an alternative to Propositional Dynamic Logic (PDL). In DL-PA, the abstract atomic programs of PDL are replaced by assignments of propositional variables to truth values. This makes DL-PA enjoy some interesting meta-logical properties that PDL does not, such as eliminability of the Kleene star, compactness and ...
متن کاملAppendix on Interpolation via translations: proofs as expected
Theorem 3.2 A consequence system (L,`) enjoys Craig interpolation with respect to an L-function var, if (i) there is a Craig generalized translation schema from (L,`) to another consequence system (L′,`′) with respect to var and an L′-function var′; (ii) (L′,`′) enjoys Craig interpolation with respect to var′. Proof: Let (h1, h2, h) be a Craig generalized translation schema from (L,`) to (L′,`′...
متن کاملCraig Interpolation via Hypersequents
In this paper, we describe a novel constructive method of proving the Craig interpolation property (CIP) based on cut-free hypersequent calculi and apply the method to prove the CIP for the modal logic S5.
متن کاملOn the Craig interpolation and the fixed point property for GLP
We prove the Craig interpolation and the fixed point property for GLP by finitary methods. Konstantin Ignatiev [4], among other things, established the Craig interpolation and the fixed point property for Japaridze’s polymodal provability logic GLP. However, it remained open if these results could be established by finitary methods formalizable in Peano arithmetic PA. (The question concerning t...
متن کامل