A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Set-theoretic completeness for epistemic and conditional logic
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
In this paper, I develop a syntactic framework for the analysis ofstrategic form games that is based on a straightforward combination ofstandard systems of doxastic, probabilistic and conditionalpropositional logic. In particular, for the probabilistic part I makeuse of the axiomatization provided in Fagin and Halpern (1994). The use ofconditionals allows to represent a strategic form game by a logicalformula in a very natural way. Also expected utility maximization can benaturally captured. I use this framework to prove a version of a resulton Nash equilibrium conjectures first presented in Aumann and Brandenburger (1995).