Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers

Details Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers

2004-11-10

arxiv.org/abs/cs/0411031v1

Computer Science

Logic in Computer Science

24 pages, 1 pstex_t figure

Scientific paper

We show that the satisfiability and finite satisfiability problems for the
two-variable fragment of first-order logic with counting quantifiers are both
in NEXPTIME, even when counting quantifiers are coded succinctly.

Affiliated with

Also associated with

No associations

Rating

Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers 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 Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-480157