In his pioneering and celebrated 1968 paper on the elementary theory of finite fields Ax asked if the theory of the class of all the finite rings $\mathbb{Z}/m\mathbb{Z}$, for all $m>1$, is decidable. In that paper, Ax proved that the existential theory of this class is decidable via his result that the theory of the class of all the rings $\mathbb{Z}/p^n\mathbb{Z}$ (with $p$ and $n$ varying) is decidable. This used Chebotarev’s Density Theorem and model theory of pseudo-finite fields.

I will talk about a recent solution jointly with Angus Macintyre of Ax’s Problem using model theory of the ring of adeles of the rational numbers.

In 1977, Erdős and Hajnal made the conjecture that, for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ has a clique or stable set of size at least $|G|^c$; and they proved that this is true with $|G|^c$ replaced by $2^{c\sqrt{\log |G|}}$. Until now, there has been no improvement on this result (for general $H$). We recently proved a strengthening: that for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ with $|G|\ge 2$ has a clique or stable set of size at least $2^{c\sqrt{\log |G| \log\log|G|}}$. This talk will outline the proof. Joint work with Matija Bucić, Tung Nguyen and Alex Scott.