Remarks on undecidability of indecomposable polynomial rings

2023/04/04 by Barone, Marco, Caro-Montoya, Nicolás, Naziazeno, Eudes
#03B10 #03B25 #03C40 #13B25 #13F99 #16U99 #FOS: Mathematics #Logic (math.LO) #Rings and Algebras (math.RA)

paper · doi:10.48550/arxiv.2304.02165

Abstract

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

Related

• Interpretability and uniform definability of integers, and undecidability of reduced indecomposable polynomial rings
• Undecidability in number theory
• Representation of powers by polynomials over function fields and a problem of Logic
• Diophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic 0
• Undefinability and Absolute Undefinability in Arithmetic