Switch to: Citations

References in:

Complexity of finite-variable fragments of propositional modal logics of symmetric frames

Mikhail Rybakov & Dmitry Shkatov

Logic Journal of the IGPL (forthcoming)

Add references

You must login to add references.

The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic.Joseph Y. Halpern - 1995 - Artificial Intelligence 75 (2):361-372.details Download Export citation Bookmark 23 citations
How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics.A. V. Chagrov & M. N. Rybakov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 71-82.details Download Export citation Bookmark 6 citations
Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.details Download Export citation Bookmark 388 citations
The decision problem of provability logic with only one atom.Vítězslav Švejdar - 2003 - Archive for Mathematical Logic 42 (8):763-768.details The decision problem for provability logic remains PSPACE-complete even if the number of propositional atoms is restricted to one. Download Export citation Bookmark 6 citations
Modal Logic.James W. Garson - 2009 - Stanford Encyclopedia of Philosophy.details Download Export citation Bookmark 50 citations
The extensions of the modal logic K.Michael C. Nagle & S. K. Thomason - 1985 - Journal of Symbolic Logic 50 (1):102-109.details Download Export citation Bookmark 14 citations
Complexity and expressivity of propositional dynamic logics with finitely many variables.Mikhail Rybakov & Dmitry Shkatov - 2018 - Logic Journal of the IGPL 26 (5):539-547.details Download Export citation Bookmark 5 citations
Every world can see a reflexive world.G. E. Hughes - 1990 - Studia Logica 49 (2):175 - 181.details Let be the class of frames satisfying the condition. Download Export citation Bookmark 11 citations

1