Game comonads and generalised quantifiers -- Adam Ó Conghaile
Duration: 46 mins 5 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: | (No description) |
|---|
| Created: | 2020-04-01 17:37 |
|---|---|
| Collection: | Online Workshop: Resources and Co-Resources: A Junction between Semantics and Descriptive Complexity |
| Publisher: | University of Cambridge |
| Copyright: | A. Ó Conghaile |
| Language: | eng (English) |
| Abstract: | Hella's k-pebble n-bijective is a long-studied generalisation of the k-pebble bijection game. While the latter captures equivalence of relational structures up to k-variable first-order logic extendended with fixed-point and counting quantifiers, Hella's game (for n>1) captures equivalence in the much more powerful extension of FO with all n-ary generalised quantifiers. In this talk, I'll present a new contruction that Anuj Dawar and I have been working on which extends Abramsky, Dawar and Wang's pebbling comonad to deal with generalised quantifiers.
slides: https://www.cst.cam.ac.uk/sites/www.cst.cam.ac.uk/files/_co_resources_online_workshop_game_comonads_generalised_quantifiers_2.pdf |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 1280x720 | 1.93 Mbits/sec | 667.25 MB | View | Download | |
| MPEG-4 Video | 640x360 | 627.09 kbits/sec | 211.66 MB | View | Download | |
| WebM | 640x360 | 283.25 kbits/sec | 95.61 MB | View | Download | |
| iPod Video | 480x360 | 519.31 kbits/sec | 175.28 MB | View | Download | |
| MP3 | 44100 Hz | 249.77 kbits/sec | 83.42 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||