Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets

Yuri Matiyasevich

Mathematics and Computers in Simulation (MATCOM), 2004, vol. 67, issue 1, 125-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: Quantifier elimination; Diophantine equations; Davis conjecture; DPRM-theorem; Hilbert’s tenth problem (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475404001594
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:67:y:2004:i:1:p:125-133

DOI: 10.1016/j.matcom.2004.05.013

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().