Solvability of the theory of integers with addition, order, and multiplication by an arbitrary number. (English) Zbl 0274.02019
MSC:
03B25 | Decidability of theories and sets of sentences |
03D80 | Applications of computability and recursion theory |
References:
[1] | Yu. L. Ershov, M. A. Lavrov, A. D. Taimanov, and M. A. Taitslin, ?Elementary theories,? Usp. Matem. Nauk,20, No. 4, 37-108 (1965). |
[2] | A. Robinson, Introduction to the Model Theory and to the Metamathematics of Algebra, Humanities (1963). · Zbl 0118.25302 |
[3] | Yu. L. Ershov, ?Solvability of elementary theories of some classes of abelian groups,? Algebra i Logika,1, No. 6, 37-41 (1963). · Zbl 0227.02027 |
[4] | Yu. V. Matiyasevich, ?Diphantine property of denumerable sets,? Dokl. Akad. Nauk SSSR,191, No. 2, 279-282 (1970). |
[5] | H. Putnam, ?On an unsolvable problem of arithmetic,? Matematika, Collection of Translations,8, No. 5, 69-79 (1964). |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.