Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets

Authors:
Yuri Matiyasevich
Affiliations:
Steklov Institute of Mathematics at Saint-Petersburg, 27 Fontanka, Saint-Petersburg 191023, Russia
Venue:
Mathematics and Computers in Simulation - Special issue: Applications of computer algebra in science, engineering, simulation and special software
Year:
2004

Citing 4
Cited 1

Proof or recursive unsolvability of Hilbert's tenth problem

American Mathematical Monthly
Hilbert's tenth problem

Hilbert's tenth problem
On Canonical Forms and Simplification

Journal of the ACM (JACM)
The Undecidability of the Existence of Zeros of Real Elementary Functions

Journal of the ACM (JACM)

On the decidability of phase ordering problem in optimizing compilation

Proceedings of the 3rd conference on Computing frontiers

Quantified Score

Hi-index	0.00

Visualization

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.