The Diophantine problem for addition and divisibility
HTML articles powered by AMS MathViewer
- by L. Lipshitz PDF
- Trans. Amer. Math. Soc. 235 (1978), 271-283 Request permission
Abstract:
An algorithm is given for deciding existential formulas involving addition and the divisibility relation over the natural numbers.References
- 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. MR 0089113
- Kurt Mahler, On the Chinese remainder theorem, Math. Nachr. 18 (1958), 120–122. MR 96565, DOI 10.1002/mana.19580180112
- Ju. V. Matijasevič, The Diophantineness of enumerable sets, Dokl. Akad. Nauk SSSR 191 (1970), 279–282 (Russian). MR 0258744
- Julia Robinson, Definability and decision problems in arithmetic, J. Symbolic Logic 14 (1949), 98–114. MR 31446, DOI 10.2307/2266510
Additional Information
- © Copyright 1978 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 235 (1978), 271-283
- MSC: Primary 10N05; Secondary 02G05, 10B05, 12A05, 12A45
- DOI: https://doi.org/10.1090/S0002-9947-1978-0469886-1
- MathSciNet review: 0469886