Dependence logic with a majority quantifier
Logic in Computer Science
2013-03-11 v6 Logic
Abstract
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.
Cite
@article{arxiv.1109.4750,
title = {Dependence logic with a majority quantifier},
author = {Arnaud Durand and Johannes Ebbing and Juha Kontinen and Heribert Vollmer},
journal= {arXiv preprint arXiv:1109.4750},
year = {2013}
}