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

This is the first draft of a chapter in a planned book on the Prisoner's Dilemma, edited by Martin Peterson, to be published by Cambridge University Press. It discusses the nature of the conditionals involved in deliberation, taking the Prisoner's Dilemma game as point of departure.

We investigate the extension of backward-induction to von Neumann extensive games (where information sets have a synchronous structure) and provide an epistemic characterization of it. Extensions of the idea of backward-induction were proposed by Penta (2009) and later by Perea (2013), who also...

This is the first draft of a chapter in a planned book on the Prisoner’s Dilemma, edited by Martin Peterson, to be published by Cambridge University Press. It discusses the nature of the conditionals involved in deliberation, taking the Prisoner's Dilemma game as point of departure.

We investigate the extension of backward-induction to von Neumann extensive games (where information sets have a synchronous structure) and provide an epistemic characterization of it. Extensions of the idea of backward-induction were proposed by Penta (2009) and later by Perea (2013), who also...

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