A complexity question in justification logic

DOI10.1016/j.jcss.2014.03.009zbMath1327.03010OpenAlexW1970335703MaRDI QIDQ2453576

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)

Related Items (1)

NEXP-Completeness and Universal Hardness Results for Justification Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower complexity bounds in justification logic
• The logic of proofs, semantically
• Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete
• On the complexity of the reflected logic of proofs
• Referential logic of proofs
• Explicit Provability and Constructive Semantics
• Self-referentiality of Justified Knowledge
• THE LOGIC OF JUSTIFICATION
• The NP-Completeness of Reflected Fragments of Justification Logics
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments

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