UNIFORM DEFINABILITY OF INTEGERS IN REDUCED INDECOMPOSABLE POLYNOMIAL RINGS

DOI10.1017/jsl.2020.50zbMath1485.03090OpenAlexW3092091517MaRDI QIDQ5858916

Nicolás Caro, Marco Barone, Eudes Naziazeno

Publication date: 15 April 2021

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2020.50

zbMATH Keywords

polynomial ringsdefinabilitylanguage of rings

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Decidability of theories and sets of sentences (03B25) Interpolation, preservation, definability (03C40)

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Six impossible rings
• Continuing horrors of topology without choice
• Defining Integers
• Diophantine definitions for some polynomial rings
• Describing Groups
• Injectivity, Projectivity, and the Axiom of Choice
• Krull Implies Zorn
• The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
• Undecidable existential theories of polynomial rings and function fields
• The Logical Complexity of Finitely Generated Commutative Rings
• INTERPRETING ARITHMETIC IN THE FIRST-ORDER THEORY OF ADDITION AND COPRIMALITY OF POLYNOMIAL RINGS
• Undecidability in Number Theory
• Definability and decision problems in arithmetic
• Undecidable Rings

This page was built for publication: UNIFORM DEFINABILITY OF INTEGERS IN REDUCED INDECOMPOSABLE POLYNOMIAL RINGS