PSPACE-decidability of Japaridze's polymodal logic
Ilya Borisovich Shapirovsky · 2008
abstract. In this paper we prove that Japaridze’s Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames that can be applied to obtain upper complexity bounds for various modal logics. Keywords: Japaridze’s polymodal Logic, computational complexity, conditional satisfiability 1