Skip to main content
SpringerLink
Log in

Hilbert’s Tenth Problem: Diophantine Equations in the Twentieth Century

  • Chapter
Book cover Mathematical Events of the Twentieth Century

Translated by R. Cooke

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. K. Appel, W. Haken. Every planar map is four colorable. Part I. Discharging. Illinois J. Math., 1977, 21(3), 429–490.

    MATH  MathSciNet  Google Scholar 

  2. G.V. Chudnovskii. Diophantine predicates. Uspekhi Mat. Nauk, 1970, 25(4), 185–186 (Russian).

    MATH  Google Scholar 

  3. M. Davis. Arithmetical problems and recursively enumerable predicates (abstract). J. Symbolic Logic, 1950, 15(1), 77–78.

    Google Scholar 

  4. M. Davis. Arithmetical problems and recursively enumerable predicates. J. Symbolic Logic, 1953, 18(1), 33–41.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Davis. An explicit Diophantine definition of the exponential function. Commun. Pure Appl. Math., 1971, 24(2), 137–145.

    MATH  Google Scholar 

  6. M. Davis. Foreword to the English translation of [24], p. xiii–xvii. Available via http://logic.pdmi.ras.ru/∼yumat/H10Pbook. A version is included in [36], pp. 90-97.

    Google Scholar 

  7. M. Davis. From logic to computer science and back. In: People and Ideas in Theoretical Computer Science (ed. C. S. Calude). New York: Springer, 1999, 53–85.

    Google Scholar 

  8. M. Davis, Yu. Matijasevich, J. Robinson. Hilbert’s tenth problem. Diophantine equations: positive aspects of a negative solution. Proc. Sympos. Pure Math., 1976, 28, 323–378. Reprinted in [37], pp. 269–324.

    MATH  Google Scholar 

  9. M. Davis, H. Putnam, J. Robinson. The decision problem for exponential Diophantine equations. Ann. Math., 1961, 74(3), 425–436. Reprinted in [37], pp. 77–88.

    Article  MATH  MathSciNet  Google Scholar 

  10. G.V. Davydov, Yu.V. Matiyasevich, G. E. Mints, V. P. Orevkov, A.O. Slisenko, A.V. Sochilina, N.A. Shanin. Sergei Yur’evich Maslov (obituary). Russ. Math. Surveys, 1984, 39(2), 133–135.

    Article  MathSciNet  Google Scholar 

  11. J. Denef. Hilbert’s tenth problem for quadratic rings. Proc. Amer. Math. Soc., 1975, 48(1), 214–220.

    Article  MATH  MathSciNet  Google Scholar 

  12. K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I. Monatsh. Math. Phys., 1931, 38(1), 173–198. Reprinted with English translation in: Kurt Gödel. Collected Works, Vol. I (ed. S. Feferman et al.). Oxford University Press, 2003, 144–195. English translation can also be found in: The Undecidable. Basic papers on undecidable propositions, unsolvable problems and computable functions (ed. M. Davis). Hewlett, NY: Raven Press, 1965; corrected reprint: Mineola, NY: Dover, 2004, 4–38; From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931 (ed. J. van Heijenoort). Cambridge, MA: Harvard University Press, 1967; reprinted 2002, 596–616.

    Article  MATH  MathSciNet  Google Scholar 

  13. R. L. Graham, D. E. Knuth, O. Patashnik. Concrete Mathematics. Reading, MA: Addison-Wesley, 1994.

    MATH  Google Scholar 

  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. See also: Arch. Math. Phys., 1901, 44–63, 213–237. Included in: D. Hilbert. Gesammelte Abhandlungen, Bd. 3. Berlin: Springer, 1935; reprinted: New York: Chelsea, 1965. English translation: Bull. Amer. Math. Soc., 1902, 8, 437–479; reprinted: ibid. (N. S.), 2000, 37(4), 407–436. Reprinted in: Mathematical Developments Arising from Hilbert Problems (ed. F. E. Browder). Providence, RI: Amer. Math. Soc., 1976, 1–34 (Proc. Sympos. Pure Math., 28).

    Google Scholar 

  15. J. P. Jones, D. Sato, H. Wada, D. Wiens. Diophantine representation of the set of prime numbers. Amer. Math. Monthly, 1976, 83(6), 449–464.

    Article  MATH  MathSciNet  Google Scholar 

  16. N.K. Kosovskii. On Diophantine representations of sequences of solutions of the Pell equation. Zap. Nauchn. Semin. LOMI, 1971, 20, 49–59 (Russian); English translation: J. Sov. Math., 1973, 1(1), 28–35.

    MATH  MathSciNet  Google Scholar 

  17. G. Kreisel. A3061: Davis, Martin; Putnam, Hilary; Robinson, Julia. The decision problem for exponential Diophantine equations. Math. Reviews, 1962, 24A(6A), 573.

    Google Scholar 

  18. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR, Sb., 1977, 32(2), 129–198.

    Article  MATH  Google Scholar 

  19. A.A. Markov. The impossibility of certain algorithms in the theory of associative systems. Dokl. Akad. Nauk SSSR, 1947, 55(7), 587–590 (Russian).

    Google Scholar 

  20. Yu.V. Matiyasevich. The connection of systems of word-length equations with Hilbert’s tenth problem. Zap. Nauchn. Semin. LOMI, 1968, 8, 132–144 (Russian); English translation: Semin. Math., V. A. Steklov Math. Inst., 1970, 8, 61–67. Available via http://logic.pdmi.ras.ru/∼yumat/Journal

    MATH  Google Scholar 

  21. Yu.V. Matiyasevich. Enumerable sets are Diophantine. Dokl. Akad. Nauk SSSR, 1970, 191(2), 279–282 (Russian); English translation: Sov. Math. Dokl., 1970, 11(2), 354–358.

    MATH  MathSciNet  Google Scholar 

  22. Yu.V. Matiyasevich. Primes are nonnegative values of a polynomial in 10 variables. Zap. Nauchn. Semin. LOMI, 1977, 68, 62–82 (Russian); English translation: J. Sov. Math., 1981, 15(1), 33–44.

    MATH  Google Scholar 

  23. J. Matijasevich. My collaboration with Julia Robinson. Math. Intelligencer, 1992, 14(4), 38–45; corrections: 1993, 15(1), 75. Reprinted in: Mathematical Conversations (compiled by R.Wilson and J.Gray). New York: Springer, 2001, 49–60. Available via http://logic.pdmi.ras.ru/∼yumat/Julia

    Article  MATH  MathSciNet  Google Scholar 

  24. Yu.V. Matiyasevich. Hilbert’s Tenth Problem. Moscow: Nauka, 1993 (Russian); English translation (with a foreword by M. Davis): Cambridge, MA: MIT Press, 1993; French translation: Le dixième problème de Hilbert. Masson, 1995. Homepage of the book: http://logic.pdmi.ras.ru/∼yumat/H10Pbook

    Google Scholar 

  25. Yurii Matiyasevich, Julia Robinson. Two universal three-quantifier representations of recursively enumerable sets. In: Theory of Algorithms and Mathematical Logic. Moscow: Computing Center of the USSR Academy of Sciences, 1974, 112–123 (Russian). Reprinted in [37], pp. 223–234. English translation available via http://logic.pdmi.ras.ru/∼yumat/Journal

    Google Scholar 

  26. Yu. Matijasevich, J. Robinson. Reduction of an arbitrary Diophantine equation to one in 13 unknowns. Acta Arithm., 1975, 27, 521–553. Reprinted in [37], pp. 235–267.

    Google Scholar 

  27. V. P. Orevkov. Complexity of Proofs and their Transformations in Axiomatic Theories. Providence, RI: Amer. Math. Soc., 1993. (Transl. Math. Monographs, 128).

    MATH  Google Scholar 

  28. T. Pheidas, K. Zahidi. Undecidability of existential theories of rings and fields: a survey. In: Hilbert’s Tenth Problem: Relations with Arithmetic and Algebraic Geometry (Ghent, 1999). Providence, RI: Amer. Math. Soc., 2000, 49–105 (Contemp. Math., 270).

    Google Scholar 

  29. E. L. Post. Recursively enumerable sets of positive integers and their decision problems. Bull. Amer. Math. Soc., 1944, 50, 284–316. Reprinted in [31], pp. 461–494.

    Article  MATH  MathSciNet  Google Scholar 

  30. E. L. Post. Recursive unsolvability of a problem of Thue. J. Symbolic Logic, 1947, 12, 1–11. Reprinted in [31], pp. 503–513.

    Article  MathSciNet  Google Scholar 

  31. E. L. Post. Solvability, Provability, Definability: The Collected Works of E. L. Post (ed. M. Davis). Boston, MA: Birkhäuser, 1994.

    Google Scholar 

  32. H. Putnam. An unsolvable problem in number theory. J. Symbolic Logic, 1960, 25(3), 220–232.

    Article  MathSciNet  Google Scholar 

  33. C. Reid. The autobiography of Julia Robinson. College Math. J., 1986, 17(1), 3–21. Extended version in [34], pp. 0–83.

    Article  MATH  MathSciNet  Google Scholar 

  34. C. Reid. JULIA. A Life in Mathematics. Washington: Math. Assoc. of America, 1996.

    MATH  Google Scholar 

  35. J.A. Robinson. A machine-oriented logic based on the resolution principle. J. Assoc. Comput. Mach., 1965, 12, 23–41; Russian translation in: Cybernetics Collection. New Ser., No. 7 (eds. A.A. Lyapunov and O.B. Lupanov). Moscow: Mir, 1970, 194–218.

    MATH  MathSciNet  Google Scholar 

  36. J. Robinson. Unsolvable Diophantine problems. Proc. Amer. Math. Soc., 1969, 22(2), 534–538. Reprinted in [37], pp. 195–199.

    Article  MATH  MathSciNet  Google Scholar 

  37. J. Robinson. The Collected Works of Julia Robinson. With an introduction of Constance Reid. Edited and with a foreword by Solomon Feferman. Providence, RI: Amer. Math. Soc., 1996 (Collected Works, 6).

    MATH  Google Scholar 

  38. R. S. Rumely. Arithmetic over the ring of all algebraic integers. J. Reine Angew. Math., 1986, 386(5), 127–133.

    MathSciNet  Google Scholar 

  39. A. Thue. Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. Vid. Skr. I. Mat.-naru. Kl., 1914, 10. Reprinted in: A. Thue. Selected Mathematical Papers. Oslo, 1977, 493–524.

    Google Scholar 

  40. N.N. Vorobiev. Fibonacci Numbers. Third augmented Russian edition: Moscow, Nauka, 1969. Translation of the 6th (1992) Russian edition: Basel: Birkhäuser, 2002.

    MATH  Google Scholar 

  41. M. J. Wasteels. Quelques propriétés des nombres de Fibonacci. Mathesis, troisième sér., 1902, 2, 60–62.

    MATH  Google Scholar 

  42. The Hilbert Problems (ed. P. S. Aleksandrov). Moscow: Nauka, 1969 (Russian); German translation: Die Hilbertschen Probleme, 4. Auflage. Frankfurt/Main: Verlag Harri Deutsch, 1998 (Ostwalds Klassiker der exakten Wiss., 252).

    Google Scholar 

  43. http://logic.pdmi.ras.ru/Hilbert10

    Google Scholar 

Download references

Authors
  1. Yu. V. Matiyasevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Academy of Sciences, Leninsky Pr. 14, 117901, Moscow, Russia

    Yu. S. Osipov

  2. Department of Mathematics, University of Princeton, Washington Road, 08544-1000, Princeton, USA

    Ya. G. Sinai

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Matiyasevich, Y.V. (2006). Hilbert’s Tenth Problem: Diophantine Equations in the Twentieth Century. In: Bolibruch, †.A.A., et al. Mathematical Events of the Twentieth Century. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-29462-7_10

Download citation

Publish with us

Policies and ethics

Search

Navigation