Abstract
In the present note we determine the complexity of the satisfiability problem of a certain modal logic of subset spaces which was proposed in [6]. The corresponding semantics is defined w.r.t. binary ramified subset trees consisting of a set X and a distinguished set 𝒪 of subsets of X such that the relation of reverse set inclusion makes 𝒪 a binary ramified tree. It turns out that the satisfiability problem of the logic is complete in NP.
Get full access to this article
View all access options for this article.