Tableau Proof Systems for Justification Logics
arXiv:1405.1828 · doi:10.1215/00294527-2024-0005
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.
21 pages
References in corpus (4)
- Labeled Sequent Calculus and Countermodel Construction for Justification Logics
- Linear Temporal Justification Logics with Past Operators
- A temporal logic of epistemic and normative justifications, with an application to the Protagoras paradox
- Impossible and Conflicting Obligations in Justification Logic