A complexity question in justification logic
From MaRDI portal
Publication:2453576
DOI10.1016/J.JCSS.2014.03.009zbMATH Open1327.03010OpenAlexW1970335703MaRDI QIDQ2453576FDOQ2453576
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Logics of knowledge and belief (including belief change) (03B42) Mechanization of proofs and logical operations (03B35)
Cites Work
- Explicit provability and constructive semantics
- The logic of proofs, semantically
- The logic of justification
- Title not available (Why is that?)
- On the complexity of the reflected logic of proofs
- Title not available (Why is that?)
- Self-referentiality of Justified Knowledge
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete
- Existential semantics for modal logic
- The NP-Completeness of Reflected Fragments of Justification Logics
- Lower complexity bounds in justification logic
- Title not available (Why is that?)
- Kolmogorov and Gödel's approach to intuitionistic logic: current developments
- Referential logic of proofs
Cited In (6)
- Tableaux and interpolation for propositional justification logics
- Lower complexity bounds in justification logic
- On the Complexity of Two-Agent Justification Logic
- A complexity question in justification logic
- The NP-Completeness of Reflected Fragments of Justification Logics
- NEXP-Completeness and Universal Hardness Results for 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)
