Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets

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.

MoreLess

Year of publication:	2004
Authors:	Matiyasevich, Yuri
Published in:	Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 67.2004, 1, p. 125-133
Publisher:	Elsevier
Subject:	Quantifier elimination \| Diophantine equations \| Davis conjecture \| DPRM-theorem \| Hilbert’s tenth problem

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010749674