The decision problem of provability logic with only one atom

DOI10.1007/S00153-003-0180-4MaRDI QIDQ1423633zbMATH OpenOpenAlexFDO

Authors 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

decision problemKripke modelspolynomial spaceprovability logic

Mathematics Subject Classification ID

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

Cites work

• Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1170091 (Why is no real title available?)
• scientific article; zbMATH DE number 757645 (Why is no real title available?)
• On the polynomial-space completeness of intuitionistic propositional logic
• Provability interpretations of modal logic
• Self-reference and modal logic
• The complexity of poor man's logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited in

(6)

• 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
• The closed fragment of IL is PSPACE hard
• On the complexity of the closed fragment of Japaridze's provability logic
• COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
• Polytime embedding of intuitionistic modal logics into their one-variable fragments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423633)