PSPACE-decidability of Japaridze's polymodal logic

In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 289-304 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

PSPACE-decidability of Japaridze's polymodal logic.Ilya Shapirovsky - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 289-304.
On PSPACE-decidability in Transitive Modal Logic.Ilya Shapirovsky - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 269-287.
On PSPACE-decidability in Transitive Modal Logic.Ilya Shapirovsky - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 269-287.
Polymodal Lattices and Polymodal Logic.John L. Bell - 1996 - Mathematical Logic Quarterly 42 (1):219-233.
A many-sorted variant of Japaridze’s polymodal provability logic.Gerald Berger, Lev D. Beklemishev & Hans Tompits - 2018 - Logic Journal of the IGPL 26 (5):505-538.
On Provability Logics with Linearly Ordered Modalities.Lev D. Beklemishev, David Fernández-Duque & Joost J. Joosten - 2014 - Studia Logica 102 (3):541-566.
On the complexity of the closed fragment of Japaridze’s provability logic.Fedor Pakhomov - 2014 - Archive for Mathematical Logic 53 (7-8):949-967.
Characterizing PSPACE with pointers.Isabel Oitavem - 2008 - Mathematical Logic Quarterly 54 (3):323-329.
Characterizing PSPACE with pointers.Isabel Oitavern - 2008 - Mathematical Logic Quarterly 54 (3):323-329.
Reasoning about sequences of memory states.Rémi Brochenin, Stéphane Demri & Etienne Lozes - 2010 - Annals of Pure and Applied Logic 161 (3):305-323.
Categoricity Spectra for Polymodal Algebras.Nikolay Bazhenov - 2016 - Studia Logica 104 (6):1083-1097.
On the decidability of implicational ticket entailment.Katalin Bimbó & J. Michael Dunn - 2013 - Journal of Symbolic Logic 78 (1):214-236.
Decidability of an Xstit Logic.Gillman Payette - 2014 - Studia Logica 102 (3):577-607.
Decidability and generalized quantifiers.Andreas Baudisch (ed.) - 1980 - Berlin: Akademie Verlag.
Normal Monomodal Logics Can Simulate All Others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.

Analytics

Added to PP
2020-02-06

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Complete additivity and modal incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
An Escape From Vardanyan’s Theorem.Ana de Almeida Borges & Joost J. Joosten - 2023 - Journal of Symbolic Logic 88 (4):1613-1638.
Münchhausen provability.Joost J. Joosten - 2021 - Journal of Symbolic Logic 86 (3):1006-1034.

Add more citations

References found in this work

No references found.

Add more references