Uniform definability of integers in reduced indecomposable polynomial rings

Journal of Symbolic Logic 85 (4):1376-1402 (2020)
  Copy   BIBTEX

Abstract

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with signature $$. In the characteristic zero case, the claim implies that the full theory is undecidable, for rings of the referred type. This extends a series of results by Raphael Robinson, holding for certain polynomial integral domains, to a more general class.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2020-10-06

Downloads
6 (#1,485,580)

6 months
3 (#1,046,015)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Marco Barone
Queen's University, Belfast

Citations of this work

No citations found.

Add more citations

References found in this work

Describing groups.André Nies - 2007 - Bulletin of Symbolic Logic 13 (3):305-339.
Defining integers.Alexandra Shlapentokh - 2011 - Bulletin of Symbolic Logic 17 (2):230-251.

Add more references