{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:26:15Z","timestamp":1725891975554},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357213"},{"type":"electronic","value":"9783642357220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35722-0_21","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:16:29Z","timestamp":1357298189000},"page":"296-306","source":"Crossref","is-referenced-by-count":1,"title":["The Logic of Uncertain Justifications"],"prefix":"10.1007","author":[{"given":"Bob","family":"Milnikel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0168-0072(94)90007-8","volume":"67","author":"S.N. Art\u00ebmov","year":"1994","unstructured":"Art\u00ebmov, S.N.: Logic of proofs. Annals of Pure and Applied Logic\u00a067(1-3), 29\u201359 (1994)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"21_CR2","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":"21_CR3","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"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S1755020308090060","volume":"1","author":"S.N. Artemov","year":"2008","unstructured":"Artemov, S.N.: The logic of justification. The Review of Symbolic Logic\u00a01(4), 477\u2013513 (2008)","journal-title":"The Review of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"Artemov, S.N.: Why do we need Justification Logic? In: van Benthem, J., Gupta, A., Pacuit, E. (eds.) Games, Norms and Reasons: Logic at the Crossroads. Synthese Library, vol.\u00a0353, ch. 2, pp. 23\u201338. Springer (2011)","key":"21_CR5","DOI":"10.1007\/978-94-007-0714-6_2"},{"key":"21_CR6","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. Artemov","year":"2006","unstructured":"Artemov, S., Kuznets, R.: Logical Omniscience Via Proof Complexity. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 135\u2013149. Springer, Heidelberg (2006)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-14808-8_23","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2010","author":"F. Bavera","year":"2010","unstructured":"Bavera, F., Bonelli, E.: Justification Logic and History Based Computation. In: Cavalcanti, A., Deharbe, D., Gaudel, M.-C., Woodcock, J. (eds.) ICTAC 2010. LNCS, vol.\u00a06255, pp. 337\u2013351. Springer, Heidelberg (2010)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-92687-0_6","volume-title":"Logical Foundations of Computer Science","author":"E. Bonelli","year":"2009","unstructured":"Bonelli, E., Feller, F.: The Logic of Proofs as a Foundation for Certifying Mobile Computation. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol.\u00a05407, pp. 76\u201391. Springer, Heidelberg (2009), Errata available at, \n                  \n                    http:\/\/www.lifia.info.unlp.edu.ar\/eduardo\/publications\/errataLFCS09.txt"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2004.04.009","volume":"132","author":"M. Fitting","year":"2005","unstructured":"Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic\u00a0132(1), 1\u201325 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"Fitting, M., Mendelsohn, R.L.: First-Order Modal Logic. Kluwer Academic Press (1998)","key":"21_CR10","DOI":"10.1007\/978-94-011-5292-1"},{"key":"21_CR11","first-page":"39","volume":"4","author":"K. G\u00f6del","year":"1933","unstructured":"G\u00f6del, K.: Eine interpretation des intuitionistischen aussagenkalk\u00fcls. Ergebnisse Math.\u00a0Colloq.\u00a04, 39\u201340 (1933)","journal-title":"Ergebnisse Math.\u00a0Colloq."},{"unstructured":"Halpern, J.: Reasoning About Uncertainty. MIT Press (2003)","key":"21_CR12"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/malq.19630090502","volume":"9","author":"S.A. Kripke","year":"1963","unstructured":"Kripke, S.A.: Semantical analysis of modal logic i. normal propositional calculi. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik\u00a09, 67\u201396 (1963)","journal-title":"Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik"},{"key":"21_CR14","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 [17]"},{"unstructured":"Kuznets, R.: On decidability of the logic of proofs with arbitrary constant specifications. In: 2004 Annual Meeting of the Association for Symbolic Logic, Carnegie Mellon University, Pittsburgh, PA, May 19\u201323. Association for Symbolic Logic, p. 111 (March 2005) (Abstract)","key":"21_CR15"},{"unstructured":"Kuznets, R.: Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center (May 2008)","key":"21_CR16"},{"doi-asserted-by":"crossref","unstructured":"Kuznets, R.: Complexity through tableaux in justification logic. In: 2008 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium 2008, Bern, Switzerland, July 3-8. Bulletin of Symbolic Logic, vol.\u00a015(1), p. 121. Association for Symbolic Logic (March 2009) (Abstract)","key":"21_CR17","DOI":"10.2178\/bsl\/1231081772"},{"issue":"3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.apal.2006.03.001","volume":"145","author":"R.S. Milnikel","year":"2007","unstructured":"Milnikel, R.S.: 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"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-63045-7_27","volume-title":"Logical Foundations of Computer Science","author":"A. Mkrtychev","year":"1997","unstructured":"Mkrtychev, A.: Models for the Logic of Proofs. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol.\u00a01234, pp. 266\u2013275. Springer, Heidelberg (1997)"},{"issue":"10","key":"21_CR20","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.ic.2008.11.005","volume":"207","author":"B. Renne","year":"2009","unstructured":"Renne, B.: Propositional games with explicit strategies. Information and Computation\u00a0207(10), 1015\u20131043 (2009); Published online April 2009","journal-title":"Information and Computation"},{"unstructured":"Sedl\u00e1r, I., Podrou\u017eek, J.: Justification logic as dynamic epistemic logic? In: Arrazola, X., Ponte, M. (eds.) Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, LogKCA 2010, pp. 431\u2013442. University of the Basque Country Press (2010)","key":"21_CR21"},{"doi-asserted-by":"crossref","unstructured":"Studer, T.: An application of justification logic to protocol verification. In: Proceedings of the 2011 Seventh International Conference on Computational Intelligence and Security, CIS 2011, pp. 779\u2013783. IEEE (2011)","key":"21_CR22","DOI":"10.1109\/CIS.2011.177"},{"issue":"4","key":"21_CR23","first-page":"297","volume":"20","author":"T. Studer","year":"2011","unstructured":"Studer, T.: Justification logic, inference tracking, and data privacy. Logic and Logical Philosophy\u00a020(4), 297\u2013306 (2011)","journal-title":"Logic and Logical Philosophy"}],"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-642-35722-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:24:26Z","timestamp":1620134666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}