TITLE: Strategies as models in infinite satisfiability games SPEAKER: Yde Venema ABSTRACT: In this talk we will discuss the role of games and strategies in the theory of logic and automata, and more specifically, in the area of modal fixpoint logics. The semantics of such logics is best understood in terms of an infinite graph game, and the satisfiability problem can be phrased using a very similar game. Seen from the right perspective, winning strategies in the latter game can be identified with models for the formula at stake. Strong game-theoretic theorems concerning the nature of winning strategies in certain infinite graph games can be directly applied in order to obtain small models for satisfiable formulas. In the talk, which is only for a small part based on the speaker's own research, we aim at giving a streamlined presentation of this body of work, based on unifying ideas from coalgebra.