A complexity question in justification logic

DOI10.1016/J.JCSS.2014.03.009MaRDI QIDQ2453576zbMATH OpenOpenAlexFDO

Authors Antonis Achilleos

Publication date 10 June 2014

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2014.03.009

zbMATH Keywords

computational complexitysatisfiabilityjustification logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logics of knowledge and belief (including belief change) (03B42) Mechanization of proofs and logical operations (03B35)

Recommendations

• A complexity question in justification logic
• Lower complexity bounds in justification logic
• On the Complexity of Two-Agent Justification Logic
• NEXP-completeness and universal hardness results for justification logic
• The NP-Completeness of Reflected Fragments of Justification Logics

Cites work

• scientific article; zbMATH DE number 1670490 (Why is no real title available?)
• scientific article; zbMATH DE number 1114348 (Why is no real title available?)
• scientific article; zbMATH DE number 2070194 (Why is no real title available?)
• Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete
• Existential semantics for modal logic
• Explicit provability and constructive semantics
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• Lower complexity bounds in justification logic
• On the complexity of the reflected logic of proofs
• Referential logic of proofs
• Self-referentiality of Justified Knowledge
• The NP-Completeness of Reflected Fragments of Justification Logics
• The logic of justification
• The logic of proofs, semantically

Cited in

(6)

• On the Complexity of Two-Agent Justification Logic
• NEXP-completeness and universal hardness results for justification logic
• Lower complexity bounds in justification logic
• The NP-Completeness of Reflected Fragments of Justification Logics
• Tableaux and interpolation for propositional justification logics
• A complexity question in justification logic

This page was built for publication: A complexity question in justification logic

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