Abstract
In §4 of Chapter V we showed that enumerable sets are the same thing as projections of level sets of primitive recursive functions. The projections of the level sets of a special kind of primitive recursive function—polynomials with coefficients in Z+—are called Diophantine sets. We note that this class does not become any larger if we allow the coefficients in the polynomial to lie in Z. The basic purpose of this chapter is to prove the following deep result: 1.2. Theorem (M. Davis, H. Putnam, J. Robinson, Yu. Matiyasevič). All enumerable sets are Diophantine. The plan of proof is described in §2. §§3–7 contain the intricate yet completely elementary constructions that make up the proof itself; these sections are not essential for understanding the subsequent material, and may be omitted if the reader so desires.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Manin, Y.I. (2009). Diophantine Sets and Algorithmic Undecidability. In: A Course in Mathematical Logic for Mathematicians. Graduate Texts in Mathematics, vol 53. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-0615-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0615-1_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-0614-4
Online ISBN: 978-1-4419-0615-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)