Tableau Proof Systems for Justification Logics
Meghdad Ghari · arXiv (Cornell University) · 2014
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.