{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T09:26:01Z","timestamp":1747646761837,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_2","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:16:29Z","timestamp":1357298189000},"page":"16-28","source":"Crossref","is-referenced-by-count":6,"title":["Explicit Generic Common Knowledge"],"prefix":"10.1007","author":[{"given":"Evangelia","family":"Antonakos","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.apal.2004.10.004","volume":"133","author":"L. Alberucci","year":"2005","unstructured":"Alberucci, L., Jaeger, G.: About cut elimination for logics of common knowledge. Annals of Pure and Applied Logic\u00a0133(1-3), 73\u201399 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72734-7_1","volume-title":"Logical Foundations of Computer Science","author":"E. Antonakos","year":"2007","unstructured":"Antonakos, E.: Justified and Common Knowledge: Limited Conservativity. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 1\u201311. Springer, Heidelberg (2007)"},{"unstructured":"Artemov, S.: Multiplicity of Common Knowledge. In: Prague Workshop on Nonclassical Epistemic Logics, June 14-15, Abstracts (2012), http:\/\/logicka.flu.cas.cz\/redaction.php?action=showRedaction&id_categoryNode=1996","key":"2_CR3"},{"issue":"1-2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s11225-012-9387-x","volume":"100","author":"S. Artemov","year":"2012","unstructured":"Artemov, S.: The ontology of justifications in the logical setting. Studia Logica\u00a0100(1-2), 17\u201330 (2012)","journal-title":"Studia Logica"},{"unstructured":"Artemov, S.: Robust Knowledge and Rationality. Technical Report TR-2010010, CUNY Ph.D. Program in Computer Science (2010)","key":"2_CR5"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S1755020308090060","volume":"1","author":"S. Artemov","year":"2008","unstructured":"Artemov, S.: The logic of justification. The Review of Symbolic Logic\u00a01(4), 477\u2013513 (2008)","journal-title":"The Review of Symbolic Logic"},{"issue":"1-3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2006.03.009","volume":"357","author":"S. Artemov","year":"2006","unstructured":"Artemov, S.: Justified Common Knowledge. Theoretical Computer Science\u00a0357(1-3), 4\u201322 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2687821","volume":"7","author":"S. Artemov","year":"2001","unstructured":"Artemov, S.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic\u00a07(1), 1\u201336 (2001)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1214\/aos\/1176343654","volume":"4","author":"R. Aumann","year":"1976","unstructured":"Aumann, R.: Agreeing to Disagree. Annals of Statistics\u00a04(6), 1236\u20131239 (1976)","journal-title":"Annals of Statistics"},{"unstructured":"Bucheli, S.: Justification Logics with Common Knowledge. PhD thesis, Universit\u00e4t Bern (2012)","key":"2_CR10"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3166\/jancl.21.35-60","volume":"21","author":"S. Bucheli","year":"2011","unstructured":"Bucheli, S., Kuznets, R., Studer, T.: Justifications for common knowledge. Journal of Applied Non-Classical Logics\u00a021(1), 35\u201360 (2011)","journal-title":"Journal of Applied Non-Classical Logics"},{"doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. MIT Press (1995)","key":"2_CR12","DOI":"10.7551\/mitpress\/5803.001.0001"},{"unstructured":"Kuznets, R., Studer, T.: Justifications, Ontology, and Conservativity. In: Bolander, T., Bra\u00fcner, T., Ghilardi, S., Moss, L. (eds.) Advances in Modal Logic, vol.\u00a09, pp. 437\u2013458 (2012)","key":"2_CR13"},{"unstructured":"Lewis, D.: Convention, A Philosophical Study. Harvard University Press (1969)","key":"2_CR14"},{"doi-asserted-by":"crossref","unstructured":"McCarthy, J., Sato, M., Hayashi, T., Igarishi, S.: On the Model Theory of Knowledge. Technical Report STAN-CS-78-657, Stanford University (1978)","key":"2_CR15","DOI":"10.21236\/ADA065502"},{"unstructured":"Troelstra, A.S., Schwittenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol.\u00a043. Cambridge University Press (1996)","key":"2_CR16"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s00224-007-9057-y","volume":"43","author":"T. Yavorskaya(Sidon)","year":"2008","unstructured":"Yavorskaya(Sidon), T.: Interacting explicit evidence systems. Theory of Computing Systems\u00a043(2), 272\u2013293 (2008), Published online (October 2007)","journal-title":"Theory of Computing Systems"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11753728_38","volume-title":"Computer Science \u2013 Theory and Applications","author":"T. Yavorskaya(Sidon)","year":"2006","unstructured":"Yavorskaya(Sidon), T.: Multi-agent Explicit Knowledge. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 369\u2013380. Springer, Heidelberg (2006)"}],"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_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:36Z","timestamp":1745942436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}