Mardi 26 novembre : Scott Mutchnik (IMJ-PRG), The Koponen conjecture,
part three
This will be the third talk on our resolution, with John Baldwin and James Freitag, of the Koponen conjecture, where in the previous two talks talk we've already shown, in part using Tomašić and Wagner's results on pseudolinearity, that every supersimple theory with quantifier elimination in a finite relational language is one-based. Motivated by our application of pseudolinearity, in this talk we discuss the main step of our proof of the Koponen conjecture, where we show that every simple theory with quantifier elimination in a finite relational language is supersimple. In the process, we further demonstrate what Kennedy (2020) calls “the fragility of the syntax-semantics distinction”.
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.