The decision problem of provability logic with only one atom

DOI10.1007/s00153-003-0180-4zbMath1038.03011OpenAlexW2012017461MaRDI QIDQ1423633

Vítězslav Švejdar

Publication date: 7 March 2004

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

Full work available at URL: https://doi.org/10.1007/s00153-003-0180-4

zbMATH Keywords

Kripke modelsprovability logicdecision problempolynomial space

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (5)

Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ On the complexity of the closed fragment of Japaridze's provability logic ⋮ The Closed Fragment of IL is PSPACE Hard ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-reference and modal logic
• Provability interpretations of modal logic
• On the polynomial-space completeness of intuitionistic propositional logic
• The Complexity of Poor Man's Logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases

This page was built for publication: The decision problem of provability logic with only one atom