Mardi 8 octobre, 10h30 - 12h, Salle 1016 : Scott Mutchnik
(IMJ-PRG) : The Koponen conjecture, part one
This will be the first talk on our solution, with John Baldwin and James Freitag, to the Koponen conjecture. As part of Shelah’s program of classifying unstable first-order theories, Koponen proposes to classify simple homogeneous structures, such as the random graph. More precisely, she conjectures (2016) that all simple theories with quantifier elimination in a finite relational language are supersimple of finite rank, and asks (2014) whether they are one-based. In this talk, we give an overview of our solution to the Koponen conjecture, where we show that the answer to this question is yes.
Exposés précédents : Années 99 - 00,
00 - 01,
01 - 02,
02 - 03,
03 - 04,
04 - 05,
05 - 06,
06 - 07,
07 - 08,
08 - 09,
09 - 10,
10 - 11,
11 - 12,
12 - 13,
13 - 14,
14 - 15,
15 - 16,
16 - 17,
17 - 18,
18 - 19,
19 - 20,
21 - 22,
22 - 23,
23 - 24
24 - 25.