Sufficient Conditions of Incompleteness for the Formalization of Parts of Arithmetic
Part of the Seminars in Mathematics book series (SM, volume 4)
In this note some sufficient conditions on the formalization of parts of arithmetic are formulated, upon compliance with which this formalization is incomplete.
KeywordsNatural Number Satisfying Condition Recursive Function Diophantine Equation Consultant Bureau
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.
Unable to display preview. Download preview PDF.
- 1.Kleene, S. C., Introduction to Metamathematics. Van Nostrand, Princeton, 1950.Google Scholar
- 2.Robinson, J., “The undecidability of exponential diophantine equations,” in: Logic, Methodology and Philosophy of Science, Stanford, Calif., 1962, pp. 12–13.Google Scholar
- 3.Martsev, A. I., Algorithms and Recursive Functions, Moscow, 1965.Google Scholar
- 5.Davis, M., “Extensions and corollaries of recent work on Hilberths tenth problem,” Illinois J. of Math., 7:246–250 (1963).Google Scholar
© Consultants Bureau 1969