A Note on Assumption-Completeness in Modal Logic
- 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
We study the notion of assumption-completeness, which is a property of belief models first introduced in . 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).
Unable to display preview. Download preview PDF.