Matthias Aschenbrenner (UCLA) The logical complexity of finitely generated commutative rings Abstract: Since the work of G\"odel we know that the theory of the ring $\mathbb Z$ of integers is very complicated. Using the coding techniques introduced by him, every finitely generated commutative ring can be interpreted in $\mathbb Z$ and therefore has a theory which is no more complicated than that of $\mathbb Z$. It has also been long known that conversely, every infinite finitely generated commutative ring interprets the integers, and hence its theory is at least as complex as that of $\mathbb Z$. However, this mutual interpretability does not fully describe the class of definable sets in such rings. The correct point of view is provided by the concept of biinterpretability, an equivalence relation on the class of firstorder structures which captures what it means for two structures to essentially have the same categories of definable sets and maps. We characterize algebraically those finitely generated rings which are biinterpretable with $\mathbb Z$. (Joint work with Anatole Kh\'elif, Eudes Naziazeno, and Thomas Scanlon.) 
