Logic Seminar

We prove simplicity for the automorphism groups of order and tournament expansions of homogeneous structures like the bounded Urysohn metric space, the random graph or more generally Fraïssé limits of free, transitive, non-trivial amalgamation classes. In particular, we will show that the automorphism group of the linearly ordered random graph is a simple group. This is joint with Filippo Calderoni and Katrin Tent.