Title of article
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets Original Research Article
Author/Authors
Yuri Matiyasevich، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
9
From page
125
To page
133
Abstract
This is a short survey of known results about elimination of quantifiers over natural numbers, and some implications of these results on the power of computer algebra systems.
Keywords
Hilbert’s tenth problem , Quantifier elimination , Diophantine equations , Davis conjecture , DPRM-theorem
Journal title
Mathematics and Computers in Simulation
Serial Year
2004
Journal title
Mathematics and Computers in Simulation
Record number
854242
Link To Document