Satisfiability for two-variable logic with two successor relations on finite linear orders
classification
💻 cs.LO
keywords
relationsfinitelinearlogicordersproblemsatisfiabilitysuccessor
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.