First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
First-Order Logic with Two Variables and Unary Temporal
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Small Substructures and Decidability Issues for First-Order Logic with Two Variables
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Note: Existential MSO over two successors is strictly weaker than over linear orders
Theoretical Computer Science
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
On notions of regularity for data languages
Theoretical Computer Science
Two-variable logic with two order relations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Results on the guarded fragment with equivalence or transitive relations
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
Two-Variable Logic with Counting and Trees
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We look at the finite satisfiability problem of the two variable fragment of first order logic with the successors of two linear orders. While the logic with both the successors and their transitive closures remains undecidable, we prove that the logic with only the successors is decidable.