Tableau Proof Systems for Justification Logics
Logic
2025-01-17 v5 Logic in Computer Science
Abstract
In this paper we present tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a syntactic proof of cut elimination. We also show the subformula property for our tableaux.
Keywords
Cite
@article{arxiv.1405.1828,
title = {Tableau Proof Systems for Justification Logics},
author = {Meghdad Ghari},
journal= {arXiv preprint arXiv:1405.1828},
year = {2025}
}
Comments
21 pages