A Note on Assumption-Completeness in Modal Logic

  • Jonathan A. Zvesper
  • Eric Pacuit
Conference paper

DOI: 10.1007/978-3-642-15164-4_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6006)
Cite this paper as:
Zvesper J.A., Pacuit E. (2010) A Note on Assumption-Completeness in Modal Logic. In: Bonanno G., Löwe B., van der Hoek W. (eds) Logic and the Foundations of Game and Decision Theory – LOFT 8. Lecture Notes in Computer Science, vol 6006. Springer, Berlin, Heidelberg

Abstract

We study the notion of assumption-completeness, which is a property of belief models first introduced in [18]. In that paper it is considered a limitative result – of significance for game theory – if a given language does not have an assumption-complete belief model. We show that there are assumption-complete models for the basic modal language (Theorem 8).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jonathan A. Zvesper
    • 1
  • Eric Pacuit
    • 2
  1. 1.Computing LaboratoryUniversity of OxfordOxfordUnited Kingdom
  2. 2.Center for Logic and Philosophy of ScienceUniversiteit van TilburgTilburgThe Netherlands

Personalised recommendations