The Logical Complexity of Finitely Generated Commutative Rings. (27th February 2018)
- Record Type:
- Journal Article
- Title:
- The Logical Complexity of Finitely Generated Commutative Rings. (27th February 2018)
- Main Title:
- The Logical Complexity of Finitely Generated Commutative Rings
- Authors:
- Aschenbrenner, Matthias
Khélif, Anatole
Naziazeno, Eudes
Scanlon, Thomas - Abstract:
- 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 $(\mathbb{N}, {+}, {\times })$ 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 $\mathbb{Z}$ . Notably, by constructing a nontrivial derivation on a nonstandard model of arithmetic we show that the ring of dual numbers over $\mathbb{Z}$ is not bi-interpretable with $\mathbb{N}$ .
- Is Part Of:
- International mathematics research notices. Volume 2020:Number 1(2020)
- Journal:
- International mathematics research notices
- Issue:
- Volume 2020:Number 1(2020)
- Issue Display:
- Volume 2020, Issue 1 (2020)
- Year:
- 2020
- Volume:
- 2020
- Issue:
- 1
- Issue Sort Value:
- 2020-2020-0001-0000
- Page Start:
- 112
- Page End:
- 166
- Publication Date:
- 2018-02-27
- Subjects:
- Mathematics -- Periodicals
510 - Journal URLs:
- http://imrn.oxfordjournals.org/ ↗
http://ukcatalogue.oup.com/ ↗ - DOI:
- 10.1093/imrn/rny023 ↗
- Languages:
- English
- ISSNs:
- 1073-7928
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 4544.001000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 12885.xml