Substructural propositional dynamic logics
Abstrakt
We prove completeness and decidability of a version of Propositional Dynamic Logic where the underlying non-modal propositional logic is a substructural logic in the vicinity of the Full Distributive Non-associative Lambek Calculus. Extensions of the result to stronger substructural logics are briefly discussed.