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

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.

[1]  Martin Otto,et al.  On Logics with Two Variables , 1999, Theor. Comput. Sci..

[2]  Christos H. Papadimitriou,et al.  On the complexity of integer programming , 1981, JACM.

[3]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[4]  Thomas Schwentick,et al.  On the Complexity of Equational Horn Clauses , 2005, CADE.

[5]  Thomas Schwentick,et al.  Two-variable logic on data words , 2011, TOCL.

[6]  H PapadimitriouChristos.  On the complexity of integer programming , 1981 .

[7]  P. Hall.  On Representatives of Subsets , 1935 .

[8]  Thomas Schwentick,et al.  Two-Variable Logic with Two Order Relations - (Extended Abstract) , 2010, CSL.

[9]  Kousha Etessami,et al.  First-Order Logic with Two Variables and Unary Temporal Logic , 2002, Inf. Comput..

[10]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[11]  Emanuel Kieronski,et al.  Results on the Guarded Fragment with Equivalence or Transitive Relations , 2005, CSL.

[12]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[13]  Lidia Tendera,et al.  On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[14]  Martin Otto,et al.  Small substructures and decidability issues for first-order logic with two variables , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[15]  Emanuel Kieronski,et al.  Decidability Issues for Two-Variable Logics with Several Linear Orders , 2011, CSL.