On the complexity of the closed fragment of Japaridze's provability logic

DOI10.1007/s00153-014-0397-4zbMath1339.03057arXiv1305.6065OpenAlexW2089432821MaRDI QIDQ482919

Fedor N. Pakhomov

Publication date: 15 December 2014

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.6065

zbMATH Keywords

computational complexityprovability logicclosed fragment

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items

Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics, Modal companions of \(K4^+\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On provability logics with linearly ordered modalities
• The decision problem of provability logic with only one atom
• Time bounded random access machines
• On the positive fragment of the polymodal provability logic GLP
• The Closed Fragment of IL is PSPACE Hard
• Reflection principles and provability algebras in formal arithmetic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• On strong provability predicates and the associated modal logics
• A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic