Two-Variable First-Order Logic with Equivalence Closure

We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2NEXPTIME, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2NEXPTIME-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite satisfiability problems. We further show that the satisfiability (=finite satisfiability) problem for the two-variable fragment of first-order logic with equivalence closure applied to a single binary predicate is NEXPTIME-complete.

[1]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[2]  Jakub Michaliszyn.  Decidability of the Guarded Fragment with the Transitive Closure , 2009, ICALP.

[3]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[4]  Martin Otto,et al.  Small substructures and decidability issues for first-order logic with two variables , 2012, The Journal of Symbolic Logic.

[5]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[6]  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.

[7]  Jakub Michaliszyn,et al.  Two-Variable First-Order Logic with Equivalence Closure , 2014, SIAM J. Comput..

[8]  Saturation-based decision procedures for extensions of the guarded fragment , 2006 .

[9]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[10]  Neil Immerman,et al.  The Boundary Between Decidability and Undecidability for Transitive-Closure Logics , 2004, CSL.

[11]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[12]  Leszek Pacholski,et al.  Complexity of two-variable logic with counting , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[13]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

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

[16]  Martin Otto,et al.  Undecidability Results on Two-Variable Logics , 1997, STACS.

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

[18]  I. Borosh,et al.  Small solutions of linear Diophantine equations , 1986, Discret. Math..

[19]  Ian Pratt-Hartmann.  Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..

[20]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[21]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

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

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

[24]  Jakub Michaliszyn,et al.  Two-Variable Universal Logic with Transitive Closure , 2012, CSL.

[25]  Wieslaw Szwast,et al.  FO^2 with one transitive relation is decidable , 2013, STACS.

[26]  Margus Veanes,et al.  The two-variable guarded fragment with transitive relations , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[27]  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).

[28]  Friedrich Eisenbrand,et al.  Carathéodory bounds for integer cones , 2006, Oper. Res. Lett..

[29]  Martin Otto,et al.  Two variable first-order logic over ordered domains , 2001, Journal of Symbolic Logic.

[30]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[31]  Wieslaw Szwast,et al.  On the decision problem for the guarded fragment with transitivity , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[32]  Emanuel Kieronski,et al.  The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard , 2003, FoSSaCS.

[33]  Erich Grädel,et al.  Undecidability results on two-variable logics , 1997, Arch. Math. Log..

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

[35]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.