The complexity of positive first-order logic without equality

Details The complexity of positive first-order logic without equality The complexity of positive first-order logic without equality

2010-03-03

arxiv.org/abs/1003.0802v1

Computer Science

Logic in Computer Science

Scientific paper

We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(B). We introduce surjective hyper-endomorphisms and use them in proving a Galois connection that characterises definability in positive equality-free FO. Through an algebraic method, we derive a complete complexity classification for our problems as B ranges over structures of size at most three. Specifically, each problem is either in Logspace, is NP-complete, is co-NP-complete or is Pspace-complete.

Affiliated with

Also associated with

No associations

Rating

The complexity of positive first-order logic without equality 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 The complexity of positive first-order logic without equality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of positive first-order logic without equality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684652