Algorithms for sentences over integral domains

DOI10.1016/0168-0072(90)90069-EzbMath0709.03003OpenAlexW1969798068MaRDI QIDQ920964

Elsie Sterbin Gottlieb

Publication date: 1990

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90069-e

zbMATH Keywords

algorithmdecidability of arithmetical \(\forall \exists \)-sentences over integral domains

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (1)

Sentences over integral domains and their computational complexities

Cites Work

• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factoring polynomials with rational coefficients
• Factoring multivariate integral polynomials
• Computational complexity of arithmetical sentences
• The elementary theory of finite fields
• Factoring Polynomials over Algebraic Number Fields
• Provability and Decidability of Arithmetical Universal-Existential Sentences
• Decidable Sentences Over Polynomial Rings
• Hilbert's Tenth Problem is Unsolvable
• Decidable fragments of field theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for sentences over integral domains