A note on assumption-completeness in modal logic

Authors:
Jonathan A. Zvesper;Eric Pacuit
Affiliations:
Computing Laboratory, University of Oxford, Oxford, United Kingdom;Center for Logic and Philosophy of Science, Universiteit van Tilburg, Tilburg, The Netherlands
Venue:
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
Year:
2008

Citing 4
Cited 0

All I know: a study in autoepistemic logic

Artificial Intelligence
Modal logic

Modal logic
Sts: a structural theory of sets

Sts: a structural theory of sets
Characterizing solution concepts in games using knowledge-based programs

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

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