Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Artemov, S.: Operational modal logic. Technical Report MSI 95–29, Cornell University (1995)
Artemov, S.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)
Artemov, S.: Kolmogorov and Gödel’s approach to intuitionistic logic: current developments. Russian Mathematical Surveys 59(2), 203–229 (2004)
Artemov, S.: The logic of justification. The Review of Symbolic Logic 1(4), 477–513 (2008)
Brezhnev, V.N.: On explicit counterparts of modal logics. Technical Report CFIS 2000–05, Cornell University (2000)
Buss, S.R., Kuznets, R.: Lower complexity bounds in justification logic (2009) (manuscript)
Buss, S.R., Kuznets, R.: The NP-completeness of reflected fragments of justification logics. In: Artëmov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 122–136. Springer, Heidelberg (2008)
Fitting, M.: A semantics for the Logic of Proofs. Technical Report TR–2003012, CUNY Ph.D. Program in Computer Science (2003)
Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic 132(1), 1–25 (2005)
Krupski, N.V.: On the complexity of the reflected logic of proofs. Theoretical Computer Science 357(1-3), 136–142 (2006)
Krupski, V.N.: Referential logic of proofs. Theoretical Computer Science 357(1-3), 143–166 (2006)
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)
Kuznets, R.: Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center (2008)
Kuznets, R.: Self-referentiality of justified knowledge. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 228–239. Springer, Heidelberg (2008)
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)
Milnikel, R.S.: Derivability in certain subsystems of the logic of proofs is \(\Pi^p_2\)-complete. Annals of Pure and Applied Logic 145(3), 223–239 (2007)
Mkrtychev, A.: Models for the logic of proofs. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 266–275. Springer, Heidelberg (1997)
Pacuit, E.: A note on some explicit modal logics. In: Proceedings of the 5th Panhellenic Logic Symposium (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Achilleos, A. (2011). A Complexity Question in Justification Logic. In: Beklemishev, L.D., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2011. Lecture Notes in Computer Science(), vol 6642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20920-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-20920-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20919-2
Online ISBN: 978-3-642-20920-8
eBook Packages: Computer ScienceComputer Science (R0)