COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Game comonads, FVM theorems, and bilinear maps
Game comonads, FVM theorems, and bilinear mapsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Jamie Vicary. Model comparison games such as the Ehrenfeucht-Fraisse game or the pebble game are fundamental tools in finite model theory, used to establish equivalence between models for a specified logic. The recently introduced game comonads give a novel categorical semantics for these these model comparison games. A Feferman-Vaught-Mostowski (FVM) theorem describes how logical equivalence behaves under composition and transformation of models. In this talk, we will discuss FVM theorems from the point of view of game comonads. In particular, we will highlight some perhaps surprising connections to classical results in monad theory, abstracting the notion of bilinear maps. We shall give a brief high-level introduction to the game comonads, and no prior knowledge of these recent constructions will be assumed. (The talk covers joint work with Tomas Jakl and Nihil Shah.) This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsi-Teams Architectural Windows & Doors Australia TechnologyOther talksParallel Plenary Session (Zoom Breakout room) - Communicating Mathematics Autumn Succulent Plant Show The Marshall Lectures 2022 -- 'Economics Without Prices and Without Games' Interplay between geometry and topology in models of collective dynamics Statistics Clinic Easter 2022 III Alhazen's Perspectiva legacy in science and art |