Solvability of the theory of integers with addition, order, and multiplication by an arbitrary number
Tóm tắt
It is known that the arithmetic of natural and integer numbers is unsolvable. Even the universal theory of integers with addition and multiplication is unsolvable. It is proved herein that an elementary theory of integers with addition, order, and multiplication by one arbitrary number is solvable and multiplication by the power of one number is unsolvable. For a certain n, the universal theory of integers with addition and n multiplications by an arbitrary number is also unsolvable.
Tài liệu tham khảo
Yu. L. Ershov, M. A. Lavrov, A. D. Taimanov, and M. A. Taitslin, “Elementary theories,” Usp. Matem. Nauk,20, No. 4, 37–108 (1965).
A. Robinson, Introduction to the Model Theory and to the Metamathematics of Algebra, Humanities (1963).
Yu. L. Ershov, “Solvability of elementary theories of some classes of abelian groups,” Algebra i Logika,1, No. 6, 37–41 (1963).
Yu. V. Matiyasevich, “Diphantine property of denumerable sets,” Dokl. Akad. Nauk SSSR,191, No. 2, 279–282 (1970).
H. Putnam, “On an unsolvable problem of arithmetic,” Matematika, Collection of Translations,8, No. 5, 69–79 (1964).