An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation

In earlier work (LICS 2016), the authors introduced two-variable first-order logic supplemented by a binary relation that allows one to say that a letter appears between two positions. We found an effective algebraic criterion that is a necessary condition for definability in this logic, and conjectured that the criterion is also sufficient, although we proved this only in the case of two-letter alphabets. Here we prove the general conjecture. The proof is quite different from the arguments in the earlier work, and required the development of novel techniques concerning factorizations of words. We extend the results to binary relations specifying that a factor appears between two positions.

Authors

• Andreas Krebs
• Kamal Lodaya
• Paritosh K. Pandya
• Howard Straubing

Keywords

• two-variable logic
• finite model theory
• algebraic automata theory