Lower complexity bounds in justification logic

TitleLower complexity bounds in justification logic
Publication TypeJournal Article
Year of Publication2012
AuthorsBuss, SR, Kuznets, R
JournalAnnals of Pure and Applied Logic
Volume163
Pagination888-905
KeywordsLogic of Proofs
AbstractJustification Logic studies epistemic and provability phenomena by introducing justifications/proofs into the language in the form of justification terms. Pure justification logics serve as counterparts of traditional modal epistemic logics, and hybrid logics combine epistemic modalities with justification terms. The computational complexity of pure justification logics is typically lower than that of the corresponding modal logics. Moreover, the so-called reflected fragments, which still contain complete information about the respective justification logics, are known to be in NP for a wide range of justification logics, pure and hybrid alike. This paper shows that, under reasonable additional restrictions, these reflected fragments are NP-complete, thereby proving a matching lower bound. The proof method is then extended to provide a uniform proof that the corresponding full pure justification logics are $\Pi^p_2$-hard, reproving and generalizing an earlier result by Milnikel.
URLhttp://www.math.ucsd.edu/~sbuss/ResearchWeb/rlp_lower/APAL09_final.pdf
DOI10.1016/j.apal.2011.09.010