All the seminars will be in MALL 2 and will be on Tuesdays at 2pm. We will usually meet before the seminar at about 1.40pm in the common room for tea and coffee.

Week 8, Tuesday 19th November
Lovkush Agarwal Reducts of the Generic Ordered Graph

Loosely speaking, a reduct of a structure $M$ is a less detailed version of $M$ obtained from $M$ be discarding information. The reducts of various structures have been classified; the two best know examples are the random graph and $(\mathbb{Q},<)$. In this talk, I will quickly describe the reducts of these two structures before going on to discuss the paper by Bodirsky, Pinsker and Pongracz in which they determine the reducts of the generic ordered graph.