On existential Büchi arithmetic in two coprime bases

2026-08-25

AI Summary

研究解决了在两个互质基数下Büchi算术的存在片段的可判定性问题，通过量词消去法证明了其可判定性。

Abstract

For multiplicatively independent natural numbers $α$ and $β$, Villemaire showed in 1992 that the first-order theory of Presburger arithmetic expanded with both Büchi predicates $V_α$ and $V_β$ is undecidable, as it encodes multiplication. In recent years, Hieronymi and Schulz showed that Presburger arithmetic expanded with the weaker power predicates $α^\mathbb{N} = \{α^n: n \in \mathbb{N}\}$ and $β^\mathbb{N}$ is also undecidable, while Karimov et al. showed that the existential fragment of this theory is decidable. These results left open the natural problem of determining the decidability of the existential fragment of Villemaire's original expansion. We settle this question for coprime $α$ and $β$. Specifically, we give a quantifier-elimination argument that proves the decidability of the existential fragment of $\mathsf{FO}(\mathbb{Z};<,+, V_α, V_β)$.

Problem

• existential fragment
• Büchi arithmetic
• coprime bases
• decidability

Innovation

• quantifier-elimination
• decidability
• existential fragment
• coprime bases