Modal logic
Models for the Logic of Proofs
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
On the Complexity of Explicit Modal Logics
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Complexity issues in justification logic
Complexity issues in justification logic
Logical omniscience as a computational complexity problem
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Self-Referential Justifications in Epistemic Logic
Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
Partial realization in dynamic justification logic
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
Justification logics are propositional modal-like logics that instead of statements A is known include statements of the form A is known for reason t where the term t can represent an informal justification for A or a formal proof of A. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in order to obtain decidability results. Apart from reproving already known results in a uniform way, we also prove new results. In particular, we use our submodel construction to establish decidability for a justification logic with common knowledge for which so far no decidability proof was available.