The logical complexity of finitely generated commutative rings

From MaRDI portal



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












This page was built for publication: The logical complexity of finitely generated commutative rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015553)