Decidable Sentences Over Polynomial Rings

DOI10.2307/2045893MaRDI QIDQ3784041zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

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

zbMATH Keywords

algorithmpolynomial rings

Mathematics Subject Classification ID

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

Recommendations

• Decidable fragments of field theories
• Polynomial time algorithms for sentences over number fields
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Complexity of Sentences over Number Rings
• Sentences over integral domains and their computational complexities

Cites work

• scientific article; zbMATH DE number 3115157 (Why is no real title available?)
• scientific article; zbMATH DE number 3765914 (Why is no real title available?)
• Arithmetical Definitions in the Ring of Integers
• Complexity of Sentences over Number Rings
• Diophantine Sets Over Algebraic Integer Rings. II
• Diophantine Sets over Some Rings of Algebraic Integers
• Factoring Polynomials over Algebraic Number Fields
• Hilbert's Tenth Problem for Quadratic Rings
• Provability and Decidability of Arithmetical Universal-Existential Sentences
• The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
• Undecidable Rings

Cited in

(10)

• A decision algorithm for linear sentences on a PFM
• scientific article; zbMATH DE number 3627285 (Why is no real title available?)
• Decidability and local-global principles
• Results on undecidability of isomorphism of forms over polynomial rings
• Decidability questions for a ring of Laurent polynomials
• Algorithms for sentences over integral domains
• A universal first-order formula defining the ring of integers in a number field
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Decidability of sub-theories of polynomials over a finite field
• Primitive recursive decidability for large rings of algebraic integers

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

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