Undecidability of indecomposable polynomial rings

DOI10.1007/S00153-024-00936-3MaRDI QIDQ7026086zbMATH OpenFDO

Authors Marco Barone, Nicolás Caro-Montoya, Eudes Naziazeno

Publication date 18 February 2025

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00153-024-00936-3

zbMATH Keywords

indecomposable ringsinterpretability of arithmeticlanguage of ringspolynomial ringsundecidability

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Polynomials over commutative rings (13B25) Arithmetic rings and other special commutative rings (13F99) Conditions on elements (16U99)

Cites work

• An Undecidability Result for Power Series Rings of Positive Characteristic. II
• Defining integer-valued functions in rings of continuous definable functions over a topological field
• Defining integers
• Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\)
• Elementary theory of a finitely generated commutative ring
• Hilbert's tenth problem over function fields of positive characteristic not containing the algebraic closure of a finite field
• scientific article; zbMATH DE number 5507563 (Why is no real title available?)
• scientific article; zbMATH DE number 3706580 (Why is no real title available?)
• scientific article; zbMATH DE number 3715696 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1201510 (Why is no real title available?)
• scientific article; zbMATH DE number 2147302 (Why is no real title available?)
• Krull Implies Zorn
• On Dipphantine definability and decidability in some rings of algebraic functions of characteristic 0
• On existential definitions of c.e. subsets of rings of functions of characteristic 0
• Recursively enumerable sets of polynomials over a finite field are Diophantine
• The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
• The logical complexity of finitely generated commutative rings
• Undecidability in Function Fields of Positive Characteristic
• Undecidability in number theory
• Undecidability in number theory
• Undecidability of existential theories of rings and fields: A survey
• Undecidable Rings
• Uniform definability of integers in reduced indecomposable polynomial rings
• Uniform existential interpretation of arithmetic in rings of functions of positive characteristic

This page was built for publication: Undecidability of indecomposable polynomial rings

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