Analytic Tableaux for Justification Logics
Logic
2016-06-14 v1
Abstract
In this paper we present analytic 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, and prove the decidability of justification logics for finite constant specifications.
Keywords
Cite
@article{arxiv.1606.03562,
title = {Analytic Tableaux for Justification Logics},
author = {Meghdad Ghari},
journal= {arXiv preprint arXiv:1606.03562},
year = {2016}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1405.1828