We consider a basic logic with two primitive uni-modal operators: one for certainty and the other for plausibility. The former is assumed to be a normal operator (corresponding - semantically - to a binary Kripke relation), while the latter is merely a classical operator (corresponding -...

Johan van Benthem has highlighted in his work that many questions arising in the analysis of strategic interaction call for logical and computational analysis. These questions lead to both formal and conceptually illuminating answers, in that they contribute to clarifying some of the underlying...

We discuss the issues that arise in modeling the notion of common belief of rationality in epistemic models of dynamic games, in particular at the level of interpretation of strategies. A strategy in a dynamic game is defined as a function that associates with every information set a choice at...

We study belief change branching-time structures. First, we identify a property of branching-time frames that is equivalent to AGM-consistency, which is defined as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an...

The temporal updating of an agent’s beliefs in response to a flow of information is modeled in a simple modal logic that, for every date t , contains a normal belief operator B_t and a non-normal information operator I_t which is analogous to the ‘only knowing’ operator discussed in the...