The logical complexity of finitely generated commutative rings

Matthias Aschenbrenner, Anatole Khélif, Eudes Naziazeno +1

We characterize those finitely generated commutative rings which are (parametrically) bi-interpretable with arithmetic: a finitely generated commutative ring $A$ is bi-interpretabl…