A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma

DOI10.1134/S1063454121030080zbMath1491.03011WikidataQ125025046 ScholiaQ125025046MaRDI QIDQ2239081

M. R. Starchak

Publication date: 2 November 2021

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)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of linear problems in fields
• Extended universal theories of the integers
• On the Chinese Remainder Theorem
• The Diophantine Problem for Addition and Divisibility
• On the Complexity of Linear Arithmetic with Divisibility

This page was built for publication: A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma