Author:
BARONE MARCO,CARO NICOLÁS,NAZIAZENO EUDES
Abstract
AbstractWe prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with signature $(0,1,+,\cdot )$. 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.
Publisher
Cambridge University Press (CUP)
Reference27 articles.
1. Quantum Groups
2. The Diophantine problem for polynomial rings and fields of rational functions
3. [1] Arthan, R. , Is $\mathbb{Z}$ first-order definable in (the ring) $\mathbb{Z}\times \mathbb{Z}$ ?. Mathematics Stack Exchange, version: 2016-01-23. Available at https://math.stackexchange.com/q/1623441.
4. Undecidability in number theory;Poonen;Notices of the American Mathematical Society,2008
5. Describing Groups
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献