PSPACE-decidability of Japaridze's polymodal logic

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.

• Type: Conference
• Year: 2008
• Where: AIML
• Authors: Ilya Shapirovsky
• Keywords: AIML 2008, Japaridze's Polymodal Logic, Logical Reasoning, Upper Complexity Bounds, Various Modal Logics