Skip to main content

Le théorème de MATIYASSÉVITCH et résultats connexes

Part of the Lecture Notes in Mathematics book series (LNM,volume 890)

Keywords

  • Nous Allons
  • Recursivement Enumerable
  • Dimension Finie
  • Seminarov LOMI

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. DAVIS, MATIYASSÉVITCH, J. ROBINSON. Proceedings of Symposia in Pure Mathematics. Vol. 28 (1976), pp. 323–378.

    CrossRef  Google Scholar 

  2. J. P. JONES. Universal diophantine Equation. The University of Calgary, Dept. Math. Research Paper, no 274 (avril 75).

    Google Scholar 

  3. MATIYASSÉVITCH. Une nouvelle démonstration du théorème de représentation exponentiellement diophantienne des prédicats récursivement énumérbles. Zapiski naoutchnykh seminarov LOMI, t. 60 (1976), pp. 75–89 (en russe).

    Google Scholar 

  4. MATIYASSÉVITCH. Les nombres premiers sont énumérés par un polynôme de 10 variables. Zapisky naoutchnykh seminarov LOMI. t. 68 (1977), pp. 62–82 (en russe).

    Google Scholar 

  5. MATIYASSÉVITCH, “Indécidabilité algorithmique des équations exponentiellement diophantiennes à trois inconnues” in Recherches en théorie des algorithmes et en logique mathématique. Ed. Naouka, Moscou 1979, pp. 69–77.

    Google Scholar 

  6. MATIYASSÉVITCH, J. ROBINSON. Reduction of an arbitrary Diophantine equation to one in 13 unknowns. Acta Arithmetica 27, (1974) 521–553.

    MathSciNet  Google Scholar 

  7. J. ROBINSON. Existential representability in arithmetic. Trans. Amer. Math. Society, (1952) v. 72, pp. 437–449.

    CrossRef  MATH  Google Scholar 

  8. R. M. ROBINSON. Arithmetical definability of field elements. J. Symbolic Logic 16, (1951) pp. 125–126.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. C. L. SIEGEL. Zur Theorie der quadratischen Formen. Nachr. Akad. Wiss. Göttingen Math. Phys. KI. II (1972) pp. 21–46.

    MathSciNet  MATH  Google Scholar 

  10. D. SINGMASTER. Notes on binomial coefficient. I. J. London Math. Soc. (1974), v. 8, no 3, pp. 545–548.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. V. A. USPENSKY, Leçons sur les fonctions calculables. Hermann, Paris (1966) (trad.).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Margenstern, M. (1981). Le théorème de MATIYASSÉVITCH et résultats connexes. In: Berline, C., McAloon, K., Ressayre, JP. (eds) Model Theory and Arithmetic. Lecture Notes in Mathematics, vol 890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095665

Download citation

  • DOI: https://doi.org/10.1007/BFb0095665

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11159-7

  • Online ISBN: 978-3-540-38629-2

  • eBook Packages: Springer Book Archive