FO^2 with one transitive relation is decidable

We show that the satisfiability problem for the two-variable first-order logic, FO^2, over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO^2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our result completes the classification of FO^2-logics over transitive structures with respect to decidability. We show that the satisfiability problem is in 2-NExpTime. Decidability of the finite satisfiability problem remains open.

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

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

[3]  Thomas Schwentick,et al.  Two-variable logic and key constraints on data words , 2011, ICDT '11.

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

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

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

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

[8]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

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

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

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

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

[13]  Amaldev Manuel.  Two Variables and Two Successors , 2010, MFCS.

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

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

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

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

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

[19]  Claire David,et al.  On the Satisfiability of Two-Variable Logic over Data Words , 2010, LPAR.

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

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

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

[23]  Thomas Schwentick,et al.  Two-Variable Logic on Words with Data , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

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

[25]  Wieslaw Szwast,et al.  The guarded fragment with transitive guards , 2004, Ann. Pure Appl. Log..