We analyze extensive games as interactive process models, using modallanguages plus matching notions of bisimulation as varieties of gameequivalences. Our technical results show how to fit existing modalnotions into this new setting.

Proof, Computation and Agency: Logic at the Crossroads provides an overview of modern logic and its relationship with other disciplines. As a highlight, several articles pursue an inspiring paradigm called 'social software', which studies patterns of social interaction using techniques from logic and computer science. The book also demonstrates how logic can join forces with game theory and social choice theory. A second main line is the logic-language-cognition connection, where the articles collected here bring several fresh perspectives. Finally, the book (...) takes up Indian logic and its connections with epistemology and the philosophy of science, showing how these topics run naturally into each other. (shrink)

Game-theoretic solution concepts describe sets of strategy profiles that are optimal for all players in some plausible sense. Such sets are often found by recursive algorithms like iterated removal of strictly dominated strategies in strategic games, or backward induction in extensive games. Standard logical analyses of solution sets use assumptions about players in fixed epistemic models for a given game, such as mutual knowledge of rationality. In this paper, we propose a different perspective, analyzing solution algorithms as processes of learning (...) which change game models. Thus, strategic equilibrium gets linked to fixed-points of operations of repeated announcement of suitable epistemic statements. This dynamic stance provides a new look at the current interface of games, logic, and computation. (shrink)