Skip to main content

Justified and Common Knowledge: Limited Conservativity

  • Conference paper

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

Abstract

We consider the relative strengths of three formal approaches to public knowledge: “any fool” knowledge by McCarthy (1970), Common Knowledge by Halpern and Moses (1990), and Justified Knowledge by Artemov (2004). Specifically, we show that epistemic systems with the Common Knowledge modality C are conservative with respect to Justified Knowledge systems on formulas χ ∧ ψ, where χ, ϕ, and ψ are C-free.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Artemov, S.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  4. Artemov, S.: Justified Common Knowledge. Theoretical Computer Science 357(1-3), 4–22 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Aumann, R.J.: Agreeing to Disagree. Annals of Statistics 4(6), 1236–1239 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Barwise, J.: Three Views of Common Knowledge. In: TARK 1988, pp. 365–379 (1988)

    Google Scholar 

  7. van Benthem, J., Sarenac, D.: The Geometry of Knowledge. ILLC Report PP-2004-21, University of Amsterdam (2004)

    Google Scholar 

  8. Bryukhov, Y.: Integration of decision procedures into high-order interactive provers. Ph.D. thesis, CUNY Graduate School (2005)

    Google Scholar 

  9. Demri, S.: Complexity of Simple Dependent Bimodal Logics. Laboratoire LEIBNIZ-CNRS, U.M.R. 5522, manuscript (2005)

    Google Scholar 

  10. Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  11. Fitting, M.: Modal Proof Theory. In: Blackburnand, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, Elsevier, Amsterdam (2006)

    Google Scholar 

  12. Geanakoplos, J.: Common Knowledge. In: TARK 1992, pp. 254–315 (1992)

    Google Scholar 

  13. Halpern, J., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), 549–587 (1990), A preliminary version appeared in 1984

    Article  MATH  MathSciNet  Google Scholar 

  14. Lehmann, D.: Knowledge, common knowledge, and related puzzles. In: Proc. 3rd ACM Symposium on Principles of Distributed Computing, pp. 62–67 (1984)

    Google Scholar 

  15. Lewis, D.: Convention, A Philosophical Study. Harvard University Press, Cambridge (1969)

    Google Scholar 

  16. 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 

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

    Google Scholar 

  18. Rubtsova, N.: On realization of S5 modalitiy by evidence terms. Journal of Logic and Computation 16, 671–684 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sergei N. Artemov Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Antonakos, E. (2007). Justified and Common Knowledge: Limited Conservativity. In: Artemov, S.N., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2007. Lecture Notes in Computer Science, vol 4514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72734-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72734-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72732-3

  • Online ISBN: 978-3-540-72734-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics