On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates

We investigate the decidability of the monadic second-order (MSO) theory of the structure ⟨N; <, 𝑃 1 , . . . , 𝑃 𝑘 ⟩, for various unary predicates 𝑃 1 , . . . , 𝑃 𝑘 ⊆ N. We focus in particular on 'arithmetic' predicates arising in the study of linear recurrence sequences, such as fixed-base powers Pow 𝑘 = 𝑘 𝑛 : 𝑛 ∈ N, 𝑘-th powers N 𝑘 = 𝑛 𝑘 : 𝑛 ∈ N, and the set of terms of the Fibonacci sequence Fib = 0, 1, 2, 3, 5, 8, 13, . . . (and similarly for other linear recurrence sequences having a single, non-repeated, dominant characteristic root). We obtain several new unconditional and conditional decidability results, a select sample of which are the following:

• The MSO theory of ⟨N; <, Pow 2 , Fib⟩ is decidable; • The MSO theory of ⟨N; <, Pow 2 , Pow 3 , Pow 6 ⟩ is decidable; • The MSO theory of ⟨N; <, Pow 2 , Pow 3 , Pow 5 ⟩ is decidable assuming Schanuel's conjecture; • The MSO theory of ⟨N; <, Pow 4 , N 2 ⟩ is decidable; • The MSO theory of ⟨N; <, Pow 2 , N 2 ⟩ is Turing-equivalent to the MSO theory of ⟨N; <, 𝑆⟩, where 𝑆 is the predicate corresponding to the binary expansion of √ 2. (As the binary expansion of √

2 is widely believed to be normal, the corresponding MSO theory is in turn expected to be decidable.) These results are obtained by exploiting and combining techniques from dynamical systems, number theory, and automata theory.