Satisfiability for two-variable logic with two successor relations on finite linear orders

Details Satisfiability for two-variable logic with two successor relations on finite linear orders Satisfiability for two-variable logic with two successor relations on finite linear orders

2012-04-11

arxiv.org/abs/1204.2495v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Satisfiability for two-variable logic with two successor relations on finite linear orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Satisfiability for two-variable logic with two successor relations on finite linear orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Satisfiability for two-variable logic with two successor relations on finite linear orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717179