Decidability of an Xstit Logic

Abstract

This paper presents proofs of completeness and decidability of a non-temporal fragment of an Xstit logic. This shows a distinction between the non-temporal fragments of Xstit logic and regular stit logic since the latter is undecidable. The proof of decidability is via the finite model property. The finite model property is shown to hold by constructing a filtration. However, the set that is used to filter the models isn't simply closed under subformulas, it has more complex closure conditions. The filtration set is akin to the Fischer---Ladner closure of a set used to show completeness and decidability of propositional dynamic logic.