Decidability of the universal theory of natural numbers with addition and divisibility-Reference-Cited by-同舟云学术

Decidability of the universal theory of natural numbers with addition and divisibility

Published:1980-11 Issue:5 Volume:14 Page:1436-1444
ISSN:0090-4104
Container-title:Journal of Soviet Mathematics
language:en
Short-container-title:J Math Sci

Author:

Bel'tyukov A. P.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,General Mathematics,Statistics and Probability,Applied Mathematics,General Mathematics,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/BF01693974.pdf

Reference5 articles.

1. Yu. V. Matiyasevich, “Recursively enumerable sets are Diophantine,” Dokl. Akad. Nauk SSSR,191, No. 2, 279–282 (1970).

2. N. K. Kosovskii, “On decidable systems consisting simultaneously of word equations and inequations in lengths of words,” Zap. Nauch. Sem. Leningr. Otd. Mat. Aka. Nauk SSSR,40, 24–49 (1974).

3. A. P. Bel'tyukov, “Representing enumerable sets with sums and divisibility,” Report Fourth Student Scientific Conference, Abstr., LGU, 4–5 (1975).

4. L. Lipshitz, “The Diophantine problem for +, ¦,” Preprint (1975).

5. Yu. L. Ershov, “The elementary theory of maximal normed fields,” Dokl. Akad. Nauk SSSR,165, No. 1, 21–23 (1965).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Proof of Bel’tyukov–Lipshitz Theorem by Quasi-Quantifier Elimination. II. The Main Reduction;Vestnik St. Petersburg University, Mathematics;2021-10

2. Compositional Satisfiability Solving in Separation Logic;Lecture Notes in Computer Science;2021

3. The diophantine problem for addition and divisibility for subrings of rational functions over finite fields;Proyecciones (Antofagasta);2020-06-03

4. THE DIOPHANTINE PROBLEM FOR ADDITION AND DIVISIBILITY OVER SUBRINGS OF THE RATIONALS;The Journal of Symbolic Logic;2017-09

5. On parametric timed automata and one-counter machines;Information and Computation;2017-04