{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:40:10Z","timestamp":1725525610466},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926863"},{"type":"electronic","value":"9783540926870"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92687-0_9","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T04:25:38Z","timestamp":1234239938000},"page":"122-136","source":"Crossref","is-referenced-by-count":2,"title":["The NP-Completeness of Reflected Fragments of Justification Logics"],"prefix":"10.1007","author":[{"given":"Samuel R.","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Kuznets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11874683_9","volume-title":"Computer Science Logic","author":"S.N. Artemov","year":"2006","unstructured":"Artemov, S.N., Kuznets, R.: Logical omniscience via proof complexity. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 135\u2013149. Springer, Heidelberg (2006)"},{"key":"9_CR2","unstructured":"Artemov, S.N.: Operational modal logic. Technical Report MSI 95\u201329, Cornell University (December 1995)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2687821","volume":"7","author":"S.N. Artemov","year":"2001","unstructured":"Artemov, S.N.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic\u00a07(1), 1\u201336 (2001)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"1-3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2006.03.009","volume":"357","author":"S.N. Artemov","year":"2006","unstructured":"Artemov, S.N.: Justified common knowledge. Theoretical Computer Science\u00a0357(1-3), 4\u201322 (2006)","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","unstructured":"Artemov, S.N.: The logic of justification. Technical Report TR\u20132008010, CUNY Ph.D. Program in Computer Science (September 2008)"},{"key":"9_CR6","unstructured":"Artemov, S.N.: Why do we need Justification Logic? Technical Report TR\u20132008014, CUNY Ph.D. Program in Computer Science (September 2008)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"688","DOI":"10.2307\/2275228","volume":"58","author":"M.L. Bonet","year":"1993","unstructured":"Bonet, M.L., Buss, S.R.: The deduction rule and linear and near-linear proof simulations. Journal of Symbolic Logic\u00a058(2), 688\u2013709 (1993)","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR8","unstructured":"Brezhnev, V.N.: On explicit counterparts of modal logics. Technical Report CFIS 2000\u201305, Cornell University (2000)"},{"key":"9_CR9","unstructured":"Krupski, N.V.: On the complexity of the reflected logic of proofs. Technical Report TR\u20132003007, CUNY Ph.D. Program in Computer Science (May 2003)"},{"issue":"1-3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2006.03.015","volume":"357","author":"N.V. Krupski","year":"2006","unstructured":"Krupski, N.V.: On the complexity of the reflected logic of proofs. Theoretical Computer Science\u00a0357(1-3), 136\u2013142 (2006)","journal-title":"Theoretical Computer Science"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-44622-2_25","volume-title":"Computer Science Logic","author":"R. Kuznets","year":"2000","unstructured":"Kuznets, R.: On the complexity of explicit modal logics. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 371\u2013383. Springer, Heidelberg (2000); Errata concerning the explicit counterparts of\u00a0\n                  \n                    \n                  \n                  $\\mathcal{D}$\n                 and\u00a0\n                  \n                    \n                  \n                  $\\mathcal{D}4$\n                 are published as [Kuz08b]"},{"key":"9_CR12","unstructured":"Kuznets, R.: Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center (May 2008)"},{"key":"9_CR13","unstructured":"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\u201339 (Abstract) (July 3-8, 2008)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-79709-8_24","volume-title":"Computer Science \u2013 Theory and Applications","author":"R. Kuznets","year":"2008","unstructured":"Kuznets, R.: Self-referentiality of justified knowledge. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 228\u2013239. Springer, Heidelberg (2008)"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R.E. Ladner","year":"1977","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.apal.2006.03.001","volume":"145","author":"R. Milnikel","year":"2007","unstructured":"Milnikel, R.: Derivability in certain subsystems of the Logic of Proofs is \n                  \n                    \n                  \n                  $\\Pi^p_2$\n                -complete. Annals of Pure and Applied Logic\u00a0145(3), 223\u2013239 (2007)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92687-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T12:27:16Z","timestamp":1548419236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92687-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926863","9783540926870"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92687-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}