Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-11T13:21:24.432Z Has data issue: false hasContentIssue false
  • English
  • Français

THE EXPONENTIAL DIOPHANTINE PROBLEM FOR ${\mathbb {Q}}$

Part of: Diophantine equations Arithmetic problems. Diophantine geometry

Published online by Cambridge University Press:  21 July 2020

MIHAI PRUNESCU
MIHAI PRUNESCU*
Affiliation:
FACULTY OF MATHEMATICS AND INFORMATICS UNIVERSITY OF BUCHAREST, BUCHAREST, ROMANIA and SIMION STOILOW INSTITUTE OF MATHEMATICS OF THE ROMANIAN ACADEMY RESEARCH UNIT 5, P.O. BOX 1–764 RO-014700BUCHAREST, ROMANIAE-mail: mihai.prunescu@imar.roE-mail: mihai.prunescu@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

We show that the set of natural numbers has an exponential diophantine definition in the rationals. It follows that the corresponding decision problem is undecidable.

Keywords

exponential diophantine equationsrational numbersdecision problemsundecidability

MSC classification

Primary: 11D61: Exponential equations
Secondary: 14G05: Rational points
Type
Articles
Information
The Journal of Symbolic Logic , Volume 85 , Issue 2 , June 2020 , pp. 671 - 672
Copyright
© The Association for Symbolic Logic 2020

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Dickson, L. E., History of the Theory of Numbers, vol. 2, Carnegie Institute, Washington, 1919; reprinted by Chelsea, New York, 1966.Google Scholar
Davis, M., Putnam, H. and Robinson, J., The decision problem for exponential diophantine equations . Annals of Mathematics, vol. 74 (1961), no. 3, pp. 425–436.CrossRefGoogle Scholar
Matiyasevich, Y., Hilbert’s Tenth Problem, MIT Press, Cambridge, MA, 1993.Google Scholar