Dependence logic with a majority quantifier

Details Dependence logic with a majority quantifier Dependence logic with a majority quantifier

2011-09-22

arxiv.org/abs/1109.4750v4

Computer Science

Logic in Computer Science

Scientific paper

We study the extension of dependence logic D by a majority quantifier M over
finite structures. We show that the resulting logic is equi-expressive with the
extension of second-order logic by second-order majority quantifiers of all
arities. Our results imply that, from the point of view of descriptive
complexity theory, D(M) captures the complexity class counting hierarchy.

Affiliated with

Also associated with

No associations

Rating

Dependence logic with a majority quantifier 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 Dependence logic with a majority quantifier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependence logic with a majority quantifier will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262634