On Expansions of Monadic Second-Order Logic with Dynamical Predicates
By: Joris Nieuwveld, Joël Ouaknine
Potential Business Impact:
Lets computers check number patterns automatically.
Expansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of B\"uchi and Elgot & Rabin on the subject in the 1960s. In the present paper, we establish decidability of the MSO theory of $\langle \mathbb{N} ; <,P \rangle$, where $P$ ranges over a large class of unary ''dynamical'' predicates, i.e., sets of non-negative values assumed by certain integer linear recurrence sequences. One of our key technical tools is the novel concept of (effective) prodisjunctivity, which we expect may also find independent applications further afield.
Similar Papers
Multidimensional tilings and MSO logic
Formal Languages and Automata Theory
Makes computer patterns follow simple rules.
Graph neural networks and MSO
Logic in Computer Science
Lets computers understand patterns in tree-like data.
Monadic Second-Order Logic of Permutations
Combinatorics
Helps computers understand patterns in ordered lists.