We use an extensive form, universal type space to provide the following epistemic characterisation of extensive form rationalisability. Say that player i strongly believes event E if i is certain of E conditional on each of her information sets consistent with E. Our main contribution is to show...

We analyze a family of extensive-form solution procedures for games with incomplete information that do not require the specification of an epistemic type space a la Harsanyi, but can accommodate a (commonly known) collection of explicit restrictions D on first-order beliefs. For any fixed D we...