2000 character limit reached
Satisfiability for two-variable logic with two successor relations on finite linear orders
Published 11 Apr 2012 in cs.LO | (1204.2495v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.