Skip to main content

Pairing Traditional and Generic Common Knowledge

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 2016)

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

Included in the following conference series:

Abstract

Common Knowledge C is a standard tool in epistemic logics. Generic Common Knowledge J is an alternative which has desirable logical behavior such as cut-elmination and which can be used in place of C in the analysis of many games and epistemic senarios. In order to compare their deductive strengths directly we define the multi-agent logic \(\mathsf{S4}_n^{CJ}\) built on a language with both C and J operators in addition to agents’ \(K_i\)s so that any finite prefix of modal operators is acceptable. We prove \(\mathsf{S4}_n^{CJ}\) is complete, decidable, and that \(J\varphi \rightarrow C\varphi \) though not \(C\varphi \rightarrow J\varphi \). Additional epistemic scenarios may be investigated which take advantage of this dual layer of common knowledge agents.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alberucci, L., Jaeger, G.: About cut elimination for logics of common knowledge. Ann. Pure Appl. Logic 133(1–3), 73–99 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Antonakos, E.: Explicit generic common knowledge. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 16–28. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  4. Artemov, S.: Robust Knowledge and Rationality. Technical Report TR-2010010, CUNY Ph.D. Program in Computer Science (2010)

    Google Scholar 

  5. Artemov, S.: Justified common knowledge. Theor. Comput. Sci. 357(1–3), 4–22 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Artemov, S.: Evidence-Based Common Knowledge. Technical Report TR-2004018, CUNY Ph.D. Program in Computer Science (2004)

    Google Scholar 

  7. Artemov, S., Fitting, M.: Justification Logic. In: E.N. Zalta (ed), The Stanford Encyclopedia of Philosophy (Fall 2012 Edition)

    Google Scholar 

  8. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  9. Brünnler, K., Studer, T.: Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Logic 160(1), 82–95 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fagin, R., Halpern, J., Moses, Y., & Vardi, M.: Reasoning About Knowledge. MIT Press, Cambridge, MA (1995, 1st MIT paperback ed., 2004)

    Google Scholar 

  11. McCarthy, J., Sato, M., Hayashi, T., Igarishi, S.: On the Model Theory of Knowledge. Technical Report STAN-CS-78-657, Stanford University (1978)

    Google Scholar 

  12. Meyer, J.-J., van der Hoek, W.: Epistemic Logic of AI and Computer Science. Cambridge Tracts in Theoretical Computer Science, vol. 41. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Evangelia Antonakos .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Antonakos, E. (2016). Pairing Traditional and Generic Common Knowledge. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2016. Lecture Notes in Computer Science(), vol 9537. Springer, Cham. https://doi.org/10.1007/978-3-319-27683-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27683-0_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27682-3

  • Online ISBN: 978-3-319-27683-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics