Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets

Mathematics and Computers in Simulation

Volumn 67, Issue 1-2, 2004, Pages 125-133

  Matiyasevich, Yuri ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

Davis conjecture; Diophantine equations; DPRM theorem; Hilbert's tenth problem; Quantifier elimination

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; MATHEMATICAL OPERATORS; NUMBER THEORY; PARTIAL DIFFERENTIAL EQUATIONS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

DAVIS CONJETURE; DIOPHANTINE EQUATIONS; DPRM-THEOREM; HILBERT'S TENTH PROBLEM; QUANTIFIER ELIMINATION;

DIGITAL ARITHMETIC;

EID: 4344637858     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.matcom.2004.05.013     Document Type: Conference Paper

References (51)

1. L. Adleman, K. Manders, Diophantine complexity, in: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, Houston, TX, 25-26 October 1976, pp. 81-88. IEEE.
2. A. Adler, Some recursively unsolvable problems in analysis, in: Proceedings of the American Mathematical Society, vol. 22, no. 2, 1969, pp. 523-526.
3. Caviness B.F., On canonical forms and simplification. J. ACM. 17(2):1970;385-396.
4. Davis M., Arithmetical problems and recursively enumerable predicates (abstract). J. Symbolic Logic. 15(1):1950;77-78.
5. Davis M., Arithmetical problems and recursively enumerable predicates. J. Symbolic Logic. 18(1):1953;33-41.
6. M. Davis, H. Putnam, A computational proof procedure, Axioms for number theory, Research on Hilbert's Tenth Problem, O.S.R. Report AFOSR TR59-124, US Air Force, October 1959.
7. M. Davis, H. Putnam, J. Robinson, The decision problem for exponential Diophantine equations, Ann. Math. 74 (2) (1961) 425-436 (Reprinted in [35].)
8. Denef J., Lipshitz L., Power series solutions of algebraic differential equations. Mathematische Annalen. 267(2):1984;213-238.
9. Denef J., Lipshitz L., Decision problems for differential equations. J. Symbolic Logic. 54(3):1989;941-950.
10. Gödel K., Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme.I. Monatsh. Math. und Phys. 38(1):1931;173-198.
11. D. Hilbert, Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker Kongress zu Paris 1900, Nachr. K. Ges. Wiss., Göttingen, Math.-Phys.Kl. (1900) 253-297 D. Hilbert, Arch. Math. Phys. (1901) 44-63, 213-237 D. Hilbert, Gesammelte Abhandlungen, Springer, Berlin, vol. 3, 1935, pp. 290-329. (Reprinted: New York: Chelsea (1965)). English translation: Bull. Am. Math. Soc. (1901-1902) 437-479. Reprinted in: Mathematical Developments arising from Hilbert problems, in: Browder (Ed.), Proceedings of symposia in pure mathematics, vol. 28, American Mathematical Society, 1976, pp. 1-34.
12. D. Hilbert, Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker Kongress zu Paris 1900, Nachr. K. Ges. Wiss., Göttingen, Math.-Phys.Kl. (1900) 253-297 D. Hilbert, Arch. Math. Phys. (1901) 44-63, 213-237 D. Hilbert, Gesammelte Abhandlungen, Springer, Berlin, vol. 3, 1935, pp. 290-329. (Reprinted: New York: Chelsea (1965)). English translation: Bull. Am. Math. Soc. (1901-1902) 437-479. Reprinted in: Mathematical Developments arising from Hilbert problems, in: Browder (Ed.), Proceedings of symposia in pure mathematics, vol. 28, American Mathematical Society, 1976, pp. 1-34.
13. D. Hilbert, Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker Kongress zu Paris 1900, Nachr. K. Ges. Wiss., Göttingen, Math.-Phys.Kl. (1900) 253-297 D. Hilbert, Arch. Math. Phys. (1901) 44-63, 213-237 D. Hilbert, Gesammelte Abhandlungen, Springer, Berlin, vol. 3, 1935, pp. 290-329. (Reprinted: New York: Chelsea (1965)). English translation: Bull. Am. Math. Soc. (1901-1902) 437-479. Reprinted in: Mathematical Developments arising from Hilbert problems, in: Browder (Ed.), Proceedings of symposia in pure mathematics, vol. 28, American Mathematical Society, 1976, pp. 1-34.
14. D. Hilbert, Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker Kongress zu Paris 1900, Nachr. K. Ges. Wiss., Göttingen, Math.-Phys.Kl. (1900) 253-297 D. Hilbert, Arch. Math. Phys. (1901) 44-63, 213-237 D. Hilbert, Gesammelte Abhandlungen, Springer, Berlin, vol. 3, 1935, pp. 290-329. (Reprinted: New York: Chelsea (1965)). English translation: Bull. Am. Math. Soc. (1901-1902) 437-479. Reprinted in: Mathematical Developments arising from Hilbert problems, in: Browder (Ed.), Proceedings of symposia in pure mathematics, vol. 28, American Mathematical Society, 1976, pp. 1-34.
15. D. Hilbert, Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker Kongress zu Paris 1900, Nachr. K. Ges. Wiss., Göttingen, Math.-Phys.Kl. (1900) 253-297 D. Hilbert, Arch. Math. Phys. (1901) 44-63, 213-237 D. Hilbert, Gesammelte Abhandlungen, Springer, Berlin, vol. 3, 1935, pp. 290-329. (Reprinted: New York: Chelsea (1965)). English translation: Bull. Am. Math. Soc. (1901-1902) 437-479. Reprinted in: Mathematical Developments arising from Hilbert problems, in: Browder (Ed.), Proceedings of symposia in pure mathematics, vol. 28, American Mathematical Society, 1976, pp. 1-34.
16. Jones J.P., Universal Diophantine equation. J. Symbolic Logic. 47:1982;549-571.
17. J.P. Jones, Yu.V. Matijasevič, Exponential Diophantine representation of recursively enumerable sets, in: J. Stern (Ed.), Proceedings of the Herbrand Symposium: Logic Colloquium '81, volume 107 of Studies in Logic and the Foundations of Mathematics, Amsterdam, North Holland, 1982, pp. 159-177.
18. Jones J.P., Matijasevič Yu.V., A new representation for the symmetric binomial coefficient and its applications. Les Annales des Sciences Mathématiques du Québec. 6(1):1982;81-97.
19. J.P. Jones, Yu.V. Matijasevich, Direct translation of register machines into exponential Diophantine equations, in: L. Priese (Ed.), Report on the 1st GTI-workshop, no. 13, Reihe Theoretische Informatik, Universität- Gesamthochschule Paderborn, 1983, pp. 117-130.
20. Jones J.P., Matijasevič Yu.V., Register machine proof of the theorem on exponential Diophantine representation of enumerable sets. J. Symbolic Logic. 49(3):1984;818-829.
21. Jones J.P., Matijasevič Yu.V., Proof of recursive unsolvability of Hilbert's tenth problem. Am. Math. Monthly. 98(8):1991;689-709.
22. Levitz H., Decidability of some problem pertaining to base 2 exponential Diophantine equations. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. 31(2):1985;109-115.
23. Manders K.L., Adleman L., NP-complete decision problems for binary quadratics. J. Comput. Syst. Sci. 16(2):1978;168-184.
24. Yu.V. Matiyasevich, Diofantovost' perechislimykh mnozhestv, Dokl. AN SSSR, 191 (2) (1970) 278-282 (Translated in: Soviet Math. Doklady 11 (2) (1970) 354-358).
25. Yu.V. Matiyasevich, Diofantovost' perechislimykh mnozhestv, Dokl. AN SSSR, 191 (2) (1970) 278-282 (Translated in: Soviet Math. Doklady 11 (2) (1970) 354-358).
26. Yu. Matiyasevich, Diofantovy mnozhestva, Uspekhi Mat. Nauk 27 (1972) 5 (167) 185-222 (Translated in: Russian Mathematical Surveys 27 (5) (1972) 124-164).
27. Yu. Matiyasevich, Diofantovy mnozhestva, Uspekhi Mat. Nauk 27 (1972) 5 (167) 185-222 (Translated in: Russian Mathematical Surveys 27 (5) (1972) 124-164).
28. Matiyasevich Yu., Arifmeticheskie predstavleniya perechislimykh mnozhestv s nebol'shim chislom kvantorov. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR (LOMI). 32:1972;77-84. (Translated as Yu.V. Matiyasevich. Arithmetical representations of enumerable sets with a small number of quantifiers, J. Sov. Math. 6 (4) (1976) 410-416).
29. Matiyasevich Yu., Arifmeticheskie predstavleniya perechislimykh mnozhestv s nebol'shim chislom kvantorov. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR (LOMI). 32:1972;77-84. (Translated as Yu.V. Matiyasevich. Arithmetical representations of enumerable sets with a small number of quantifiers, J. Sov. Math. 6 (4) (1976) 410-416).
30. Yu. Matiyasevich, Novoe dokazatel'stvo teoremy ob èksponentsial'no diofantovom predstavlenii perechislimykh predikatov. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR (LOMI) 60 (1976) 75-92 (Translated in: J. Sov. Math. 14 (5) (1980) 1475-1486).
31. Yu. Matiyasevich, Novoe dokazatel'stvo teoremy ob èksponentsial'no diofantovom predstavlenii perechislimykh predikatov. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR (LOMI) 60 (1976) 75-92 (Translated in: J. Sov. Math. 14 (5) (1980) 1475-1486).
32. Yu. Matijasevich, Some purely mathematical results inspired by mathematical logic, in: Proceedings of Fifth International Congress on Logic, Methodology and Philosophy of Science, London, Ontario, 1975, Reidel, Dordrecht, 1977, pp. 121-127.
33. Yu.V. Matiyasevich, Algorifmicheskaya nerazreshimost' eksponentsial'no diofantovykh uravneniǐ s tremya neizvestnymi. Issledovaniya po teorii algorifmov i matematicheskoǐ logike, in: A.A. Markov, V.I. Homich (Eds.), Akademiya Nauk SSSR, Moscow 3, 1979, pp. 69-78 (Translated in: Selecta Mathematica Sovietica 3 (3) (1983-1984) 223-232).
34. Yu.V. Matiyasevich, Algorifmicheskaya nerazreshimost' eksponentsial'no diofantovykh uravneniǐ s tremya neizvestnymi. Issledovaniya po teorii algorifmov i matematicheskoǐ logike, in: A.A. Markov, V.I. Homich (Eds.), Akademiya Nauk SSSR, Moscow 3, 1979, pp. 69-78 (Translated in: Selecta Mathematica Sovietica 3 (3) (1983-1984) 223-232).
35. Yu. Matiyasevich, Desyataya Problema Gilberta. Moscow, Fizmatlit, 1993. English translation: Hilbert's tenth problem. MIT Press, 1993. French translation: Le dixième problème de Hilbert, Masson, 1995. URL: http://logic.pdmi.ras.ru~/yumat/H10Pbook mirrored at http://www.informatik.uni- stuttgart.de/ifi/ti/personen/Matiyasevich/H10Pbook.
36. Yu. Matiyasevich, Desyataya Problema Gilberta. Moscow, Fizmatlit, 1993. English translation: Hilbert's tenth problem. MIT Press, 1993. French translation: Le dixième problème de Hilbert, Masson, 1995. URL: http://logic.pdmi.ras.ru~/yumat/H10Pbook mirrored at http://www.informatik.uni- stuttgart.de/ifi/ti/personen/Matiyasevich/H10Pbook.
37. Yu. Matiyasevich, Desyataya Problema Gilberta. Moscow, Fizmatlit, 1993. English translation: Hilbert's tenth problem. MIT Press, 1993. French translation: Le dixième problème de Hilbert, Masson, 1995. URL: http://logic.pdmi.ras.ru~/yumat/H10Pbook mirrored at http://www.informatik.uni- stuttgart.de/ifi/ti/personen/Matiyasevich/H10Pbook.
38. Yu. Matiyasevich, A direct method for simulating partial recursive functions by Diophantine equations, Ann. Pure Appl. Logic 67 (1994) 325-348.
39. Matiyasevich Yu., Hilbert's tenth problem: what was done and what is to be done. Contemporary Math. 270:2000;1-47.
40. Yu. Matiyasevich, Dhz. Robinson, Dva universal'nykh trëkhkvantornykh predstavleniya perechislimykh mnozhestv, in: B.A. Kushner, N.M. Nagorny (Eds.), Teoriya algorifmov i matematicheskaya logika. Vychislitel'nyǐ Tsentr, Akademiya Nauk SSSR, Moscow, 1974, pp. 112-123 (Reprinted in [35]; English translation available at URL: http://logic.pdmi.ras.ru/~yumat/Journal, mirrored at http://www.informatik.uni-stuttgart.de/ifi/ti/personen/Matiyasevich/Journal ).
41. Yu. Matijasevič, J. Robinson. Reduction of an arbitrary Diophantine equation to one in 13 unknowns, Acta Arithmetica 27 (1975) 521-553 (Reprinted in [35].).
42. P. Pappas, A Diophantine problem for Laurent polynomial rings, in: Proceedings of the American Mathematical Society, vol. 93, no. 4, 1985, pp. 713-718.
43. Yu.G. Penzin, Nerazreshimye teorii kol'tsa nepreryvnykh funktsiǐ, Algoritmicheskie voprosy algebraicheskikh sistem, Irkutsk, 1978, pp. 142-147.
44. Richardson D., Some undecidable problems involving elementary functions of a real variable. J. Symbolic Logic. 33(4):1968;514-520.
45. Robinson J.B., The undecidability of exponential Diophantine equations. Notices Am. Math. Soc. 7(1):1960;75.
46. J. Robinson, The Collected Works of Julia Robinson, With an introduction by C. Reid, in: S. Feferman (Ed.), Collected Works, vol. 6, 1996, xliv + 338pp, American Mathematical Society, Providence, RI. ISBN: 0-8218-0575-4.
47. Robinson R., Arithmetical representation of recursively enumerable sets. J. Symbolic Logic. 21(2):1956;162-186.
48. Robinson R., Some representations of Diophantine sets. J. Symbolic Logic. 37(3):1972;572-578.
49. Scarpellini B., Zwei unentscheidbare Probleme der Analysis. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. 9(4):1963;265-289.
50. Singer M.F., The model theory of ordered differential fields. J. Symbolic Logic. 43(1):1978;82-91.
51. Wang P.S., The undecidability of the existence of zeros of real elementary functions. J. ACM. 21(4):1974;586-589.