Sciweavers

Share
AIML
2008

PSPACE-decidability of Japaridze's polymodal logic

9 years 8 months ago
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.
Ilya Shapirovsky
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where AIML
Authors Ilya Shapirovsky
Comments (0)
books