Logic Seminar - Daoud Siniora

 Automorphisms of meet-trees

Abstract: A meet-tree is a partial order such that the set of vertices below any vertex is linearly ordered, and for every pair of vertices there is a greatest element smaller than or equal to each of them. I'll talk on a work in progress with Itay Kaplan and Tomasz Rzepecki mainly showing that the universal homogeneous countable meet-tree admits generic automorphisms.


Wed, 24/10/2018 - 11:00 to 13:00


Ross 63