Skip to main content
Log in

First Order Common Knowledge Logics

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

In this paper we investigate first order common knowledge logics; i.e., modal epistemic logics based on first order logic with common knowledge operators. It is shown that even rather weak fragments of first order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the first order part of which is based on constant symbols and the equality symbol only. Then formal properties of "quantifying into" epistemic contexts are investigated. The results are illustrated by means of epistemic representations of Nash Equilibria for finite games with mixed strategies.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aumann, R. J., ‘Agreeing to disagree’, The Annals of Statistics 4, (1976), 1236-1239.

    Google Scholar 

  2. Bacharach, M., ‘The Epistemic structure of a theory of Game’, Theory and Decision 37 (1994), 7-48.

    Google Scholar 

  3. Fagin, R., J. Halpern, Y. Moses, M. Vardi, Reasoning about Knowledge, MIT Press, 1995.

  4. Harel, D., ‘Effective transformations on infinite trees with applications to high undecidability, dominoes, and fairness’, Journal of the ACM 33 (1986), 224-248.

    Google Scholar 

  5. Hintikka, J., Knowledge and Belief: An Introduction to the Logic of Two Notions, Cornell University Press, 1962.

  6. Kaneko, M., T. Nagashima, ‘Game Logic and its applications 1’, Studia Logica 57 (1996), 325-354.

    Google Scholar 

  7. Kaneko, M., T. Nagasiiima, ‘Game Logic and its applications 2’, Studia Logica 58 (1997), 273-303.

    Google Scholar 

  8. Meyer, J. J., W. van der Hoek, Epistemic Logic for AI and Computer Science, Cambridge University Press, 1995.

  9. Nash, J., ‘Noncooperative games’, Annals of Mathematics 54 (1991), 286-295.

    Google Scholar 

  10. Spaan, E. ‘Complexity of Modal Logics’, Ph.D. thesis, University of Amsterdam, 1993.

  11. Tanaka, Y., ‘Representation of modal algebras and completeness of infinitary predicate multi-modal logic’, Ph.D. thesis, Japan Advanced Institute of Science and Technology, 1999.

  12. Tanaka, Y., H. Ono, ‘Rasiowa-Sikorski Lemma and Kripke completeness of Predicate and Infinitary modal logics’, in: Advances in Modal Logic. Volume 2, K. Segerberg, M. de Rijke, H. Wansing and M. Zakharyaschev (eds.), CSLI, Stanford, 1999.

    Google Scholar 

  13. Tarski, A., ‘A decision method for elementary algebra and geometry’, Berkeley, 1948.

  14. Wolter, F., M. Zakharyaschev, ‘Decidable fragments of first-order modal logics’ (Submitted).

  15. von Neumann, J., ‘A model of general economic equilibrium’, Review of Economic Studies 13 (1945), 1-9.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wolter, F. First Order Common Knowledge Logics. Studia Logica 65, 249–271 (2000). https://doi.org/10.1023/A:1005271815356

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005271815356

Navigation