Skip to main content
Springer Nature Link
Log in

The NP-Completeness of Reflected Fragments of Justification Logics

  • Conference paper
Logical Foundations of Computer Science (LFCS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5407))

Included in the following conference series:

Abstract

Justification 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Artemov, S.N., Kuznets, R.: Logical omniscience via proof complexity. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 135–149. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Artemov, S.N.: Operational modal logic. Technical Report MSI 95–29, Cornell University (December 1995)

    Google Scholar 

  3. Artemov, S.N.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Artemov, S.N.: Justified common knowledge. Theoretical Computer Science 357(1-3), 4–22 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Artemov, S.N.: The logic of justification. Technical Report TR–2008010, CUNY Ph.D. Program in Computer Science (September 2008)

    Google Scholar 

  6. Artemov, S.N.: Why do we need Justification Logic? Technical Report TR–2008014, CUNY Ph.D. Program in Computer Science (September 2008)

    Google Scholar 

  7. Bonet, M.L., Buss, S.R.: The deduction rule and linear and near-linear proof simulations. Journal of Symbolic Logic 58(2), 688–709 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Brezhnev, V.N.: On explicit counterparts of modal logics. Technical Report CFIS 2000–05, Cornell University (2000)

    Google Scholar 

  9. Krupski, N.V.: On the complexity of the reflected logic of proofs. Technical Report TR–2003007, CUNY Ph.D. Program in Computer Science (May 2003)

    Google Scholar 

  10. Krupski, N.V.: On the complexity of the reflected logic of proofs. Theoretical Computer Science 357(1-3), 136–142 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kuznets, R.: On the complexity of explicit modal logics. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 371–383. Springer, Heidelberg (2000); Errata concerning the explicit counterparts of \(\mathcal{D}\) and \(\mathcal{D}4\) are published as [Kuz08b]

    Chapter  Google Scholar 

  12. Kuznets, R.: Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center (May 2008)

    Google Scholar 

  13. Kuznets, R.: Complexity through tableaux in justification logic. In: Abstracts of Plenary Talks, Tutorials, Special Sessions, Contributed Talks of Logic Colloquium (LC 2008), Bern, Switzerland, pp. 38–39 (Abstract) (July 3-8, 2008)

    Google Scholar 

  14. 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)

    Chapter  Google Scholar 

  15. Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing 6(3), 467–480 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  16. Milnikel, R.: 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)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, San Diego, La Jolla, CA 92093-0112, USA

    Samuel R. Buss

  2. Institut für Informatik und angewandte Mathematik, Universität Bern, Neubrückstrasse 10, CH-3012, Bern, Switzerland

    Roman Kuznets

Authors
  1. Samuel R. Buss
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Kuznets
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, CUNY Graduate Center, 365 Fifth Avenue, NY 10016, New York, USA

    Sergei Artemov

  2. Department of Mathematics, Cornell University, 545 Malott Hall, NY 14853, Ithaca, USA

    Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buss, S.R., Kuznets, R. (2008). The NP-Completeness of Reflected Fragments of Justification Logics. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92687-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92686-3

  • Online ISBN: 978-3-540-92687-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation