Logic Seminar

Local stability has been used in the recent years to treat problems in additive combinatorics. Whilst many of the techniques of geometric stability theory have been generalised to simple theories, there is no local treatment of simplicity. Kaplan and Shelah showed that the theory of the additive group of the integers together with a predicate for the prime integers is supersimple of rank 1, assuming Dickson’s conjecture. We will see how to use their result to deduce that all but finitely many integers belongs to infinitely many arithmetic progressions in the primes, which resonates with previous unconditional work (without assuming Dickson’s conjecture) of van der Corput and of Green. If times permits, we will discuss analogous results asymptotically for finite fields.