%0 Journal Article
%T Tableaux for Dynamic Logic of Propositional Assignments
%A Tiago de Lima
%A Andreas Herzig
%J Computer Science
%D 2014
%I arXiv
%X 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 interpolation. We define and analytic tableaux calculus for DL-PA and show that it matches the known complexity results.
%U http://arxiv.org/abs/1406.2161v1