Two-Variable Logic with Two Order Relations - (Extended Abstract)

d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order relations is investigated. Firstly, decidability is shown for structures with one total preorder relation and one linear order relation. More specifically, we show that this problem is complete for EXPSPACE. As a consequence, the same upper bound applies to the case of two linear orders. Secondly, we prove undecidability for structures with two total preorder relations as well as for structures with one total preorder and two linear order relations. Further, we point out connections to other logics. Decidability is shown for two-variable logic on data words with orders on both positions and data values, but without a successor relation. We also study "partial models" of compass and interval temporal logic and prove decidability for some of their fragments.

• Type: Conference
• Year: 2010
• Where: CSL
• Authors: Thomas Schwentick, Thomas Zeume
• Keywords: Automated Reasoning, CSL 2010, Linear Order, Linear Order Relations, Order Relations