University of Isfahan & Institute for Research in Fundamental Sciences (IPM)
Abstract. In this paper we present tableau proof systems for proposi- tional justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. Some of the tableau systems are fully analytic and can be used to prove the decidability of justification logics for finite constant specifications. Finally we prove the interpolation property and Beth definability property for some of the justification logics.