Abstract
The name Generic Common Knowledge (GCK) was suggested by Artemov to capture a state of a multi-agent epistemic system that yields iterated knowledge I(ϕ): ‘any agent knows that any agent knows that any agent knows…ϕ’ for any number of iterations. The generic common knowledge of ϕ, \(\mbox{\em GCK}(\varphi)\), yields I(ϕ),
but is not necessarily logically equivalent to I(ϕ). Modal logics with GCK were suggested by McCarthy and Artemov. It has been shown that in the usual epistemic scenarios, GCK can replace the conventional common knowledge. Artemov noticed that such epistemic actions as public announcements of atomic sentences, generally speaking, yield GCK rather than the conventional common knowledge. In this paper we introduce logics with explicit GCK and show that they realize corresponding modal systems, i.e., GCK, along with the individual knowledge modalities, can be always made explicit.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alberucci, L., Jaeger, G.: About cut elimination for logics of common knowledge. Annals of Pure and Applied Logic 133(1-3), 73–99 (2005)
Antonakos, E.: Justified and Common Knowledge: Limited Conservativity. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 1–11. Springer, Heidelberg (2007)
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
Artemov, S.: The ontology of justifications in the logical setting. Studia Logica 100(1-2), 17–30 (2012)
Artemov, S.: Robust Knowledge and Rationality. Technical Report TR-2010010, CUNY Ph.D. Program in Computer Science (2010)
Artemov, S.: The logic of justification. The Review of Symbolic Logic 1(4), 477–513 (2008)
Artemov, S.: Justified Common Knowledge. Theoretical Computer Science 357(1-3), 4–22 (2006)
Artemov, S.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)
Aumann, R.: Agreeing to Disagree. Annals of Statistics 4(6), 1236–1239 (1976)
Bucheli, S.: Justification Logics with Common Knowledge. PhD thesis, Universität Bern (2012)
Bucheli, S., Kuznets, R., Studer, T.: Justifications for common knowledge. Journal of Applied Non-Classical Logics 21(1), 35–60 (2011)
Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. MIT Press (1995)
Kuznets, R., Studer, T.: Justifications, Ontology, and Conservativity. In: Bolander, T., Braüner, T., Ghilardi, S., Moss, L. (eds.) Advances in Modal Logic, vol. 9, pp. 437–458 (2012)
Lewis, D.: Convention, A Philosophical Study. Harvard University Press (1969)
McCarthy, J., Sato, M., Hayashi, T., Igarishi, S.: On the Model Theory of Knowledge. Technical Report STAN-CS-78-657, Stanford University (1978)
Troelstra, A.S., Schwittenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol. 43. Cambridge University Press (1996)
Yavorskaya(Sidon), T.: Interacting explicit evidence systems. Theory of Computing Systems 43(2), 272–293 (2008), Published online (October 2007)
Yavorskaya(Sidon), T.: Multi-agent Explicit Knowledge. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 369–380. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antonakos, E. (2013). Explicit Generic Common Knowledge. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2013. Lecture Notes in Computer Science, vol 7734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35722-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-35722-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35721-3
Online ISBN: 978-3-642-35722-0
eBook Packages: Computer ScienceComputer Science (R0)