Satisfiability for two-variable logic with two successor relations on finite linear orders

Abstract

We study the finitary satisfiability problem for first order logic with two variables and two binary relations, corresponding to the induced successor relations of two finite linear orders. We show that the problem is decidable in NEXPTIME.