A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction

DOI10.1134/S106345412104018XzbMath1491.03012MaRDI QIDQ2668897

M. R. Starchak

Publication date: 9 March 2022

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

zbMATH Keywords

quantifier eliminationdecidabilitydivisibilityChinese remainder theoremexistential theory

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)

Cites Work

• Decidability of the universal theory of natural numbers with addition and divisibility
• A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma
• The Diophantine Problem for Addition and Divisibility
• A Bound on Solutions of Linear Integer Equalities and Inequalities
• On the Complexity of Linear Arithmetic with Divisibility
• Emptiness Problems for Integer Circuits
• On direct products of theories

This page was built for publication: A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction