A Complexity Question in Justification Logic
Bounds for the computational complexity of major justification logics were found in papers by Buss, N. Krupski, Kuznets, and Milnikel: logics J, J4, JT, LP and JD, were established to be \(\Sigma_2^p\)-complete. A corresponding lower bound is also known for JD4, the system that includes the consistency axiom and positive introspection. However, no upper bound has been established so far for this logic. Here, the missing upper bound for the complexity of JD4 is established through an alternating algorithm. It is shown that using Fitting models of only two worlds is adequate to describe JD4; this helps to produce an effective tableau procedure and essentially is what distinguishes the new algorithm from existing ones.
KeywordsJustification Logic Computational Complexity Satisfiability
Unable to display preview. Download preview PDF.
- 1.Artemov, S.: Operational modal logic. Technical Report MSI 95–29, Cornell University (1995)Google Scholar
- 5.Brezhnev, V.N.: On explicit counterparts of modal logics. Technical Report CFIS 2000–05, Cornell University (2000)Google Scholar
- 6.Buss, S.R., Kuznets, R.: Lower complexity bounds in justification logic (2009) (manuscript)Google Scholar
- 8.Fitting, M.: A semantics for the Logic of Proofs. Technical Report TR–2003012, CUNY Ph.D. Program in Computer Science (2003)Google Scholar
- 12.Kuznets, R.: On the complexity of explicit modal logics. In: Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic, pp. 371–383. Springer, Heidelberg (2000)Google Scholar
- 13.Kuznets, R.: Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center (2008)Google Scholar
- 15.Kuznets, R.: Complexity through tableaux in justification logic. In: 2008 European Summer Meeting of the ASL, Logic Colloquium (2008); Bulletin of Symbolic Logic 15(1), 121 (2009)Google Scholar
- 18.Pacuit, E.: A note on some explicit modal logics. In: Proceedings of the 5th Panhellenic Logic Symposium (2005)Google Scholar