论文信息 - PSPACE-decidability of Japaridze's polymodal logic

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 proc edure for satisfiability on hereditarily ordered frames that can be applied to obtain upper complexity bounds for various modal logics.

Ilya Shapirovsky | I. Shapirovsky

[1] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .

[2] Richard Spencer-Smith,et al. Modal Logic , 2007 .

[3] M. F.,et al. Bibliography , 1985, Experimental Gerontology.

[4] Konstantin N. Ignatiev,et al. On strong provability predicates and the associated modal logics , 1993, Journal of Symbolic Logic.

[5] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[6] Michael Zakharyaschev,et al. Modal Logic , 1997, Oxford logic guides.

[7] Lev D. Beklemishev,et al. Kripke semantics for provability logic GLP , 2007, Ann. Pure Appl. Log..

[8] Ilya Shapirovsky. On PSPACE-decidability in Transitive Modal Logic , 2004, Advances in Modal Logic.

[9] D.H.J. de Jongh,et al. The logic of the provability , 1998 .

[10] Luis Fariñas del Cerro,et al. A General Framework for Pattern-Driven Modal Tableaux , 2002, Log. J. IGPL.

[11] V. Svejdar. On provability logic , 1999 .