The logical complexity of finitely generated commutative rings
arXiv:1610.04768
Abstract
We characterize those finitely generated commutative rings which are (parametrically) bi-interpretable with arithmetic: a finitely generated commutative ring is bi-interpretable with if and only if the space of non-maximal prime ideals of is nonempty and connected in the Zariski topology and the nilradical of has a nontrivial annihilator in . Notably, by constructing a nontrivial derivation on a nonstandard model of arithmetic we show that the ring of dual numbers over is not bi-interpretable with .
39 pp