The Diophantine problem for addition and divisibility. (English) Zbl 0374.02025
MSC:
03D80 | Applications of computability and recursion theory |
11A07 | Congruences; primitive roots; residue systems |
11U05 | Decidability (number-theoretic aspects) |
03B25 | Decidability of theories and sets of sentences |
References:
[1] | A. J. Goldman, Resolution and separation theorems for polyhedral convex sets, Linear inequalities and related systems, Annals of Mathematics Studies, no. 38, Princeton University Press, Princeton, N. J., 1956, pp. 41 – 51. · Zbl 0072.37505 |
[2] | Kurt Mahler, On the Chinese remainder theorem, Math. Nachr. 18 (1958), 120 – 122. · Zbl 0092.00301 · doi:10.1002/mana.19580180112 |
[3] | Ju. V. Matijasevič, The Diophantineness of enumerable sets, Dokl. Akad. Nauk SSSR 191 (1970), 279 – 282 (Russian). |
[4] | Julia Robinson, Definability and decision problems in arithmetic, J. Symbolic Logic 14 (1949), 98 – 114. · Zbl 0034.00801 · doi:10.2307/2266510 |
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.