Complexity of two-variable Dependence Logic and IF-Logic

Details Complexity of two-variable Dependence Logic and IF-Logic Complexity of two-variable Dependence Logic and IF-Logic

2011-04-15

arxiv.org/abs/1104.3148v1

Computer Science

Logic in Computer Science

27 pages, extended version of LICS 2011 paper

Scientific paper

We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a constant symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).

Affiliated with

Also associated with

No associations

Rating

Complexity of two-variable Dependence Logic and IF-Logic 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 two-variable Dependence Logic and IF-Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of two-variable Dependence Logic and IF-Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346224