Decidable Sentences Over Polynomial Rings

DOI10.2307/2045893zbMath0643.03007OpenAlexW4232161519MaRDI QIDQ3784041

No author found.

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2045893

zbMATH Keywords

algorithmpolynomial rings

Mathematics Subject Classification ID

Decidability and field theory (12L05) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Algorithms for sentences over integral domains

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of Sentences over Number Rings
• Factoring Polynomials over Algebraic Number Fields
• Provability and Decidability of Arithmetical Universal-Existential Sentences
• Diophantine Sets Over Algebraic Integer Rings. II
• Hilbert's Tenth Problem for Quadratic Rings
• The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
• Diophantine Sets over Some Rings of Algebraic Integers
• Undecidable Rings
• Arithmetical Definitions in the Ring of Integers

This page was built for publication: Decidable Sentences Over Polynomial Rings