License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2011.252
URN: urn:nbn:de:0030-drops-33467
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3346/
Go to the corresponding LIPIcs Volume Portal


Durand, Arnaud ; Ebbing, Johannes ; Kontinen, Juha ; Vollmer, Heribert

Dependence logic with a majority quantifier

pdf-format:
28.pdf (0.5 MB)


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.

BibTeX - Entry

@InProceedings{durand_et_al:LIPIcs:2011:3346,
  author =	{Arnaud Durand and Johannes Ebbing and Juha Kontinen and Heribert Vollmer},
  title =	{{Dependence logic with a majority quantifier }},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
  pages =	{252--263},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-34-7},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{13},
  editor =	{Supratik Chakraborty and Amit Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3346},
  URN =		{urn:nbn:de:0030-drops-33467},
  doi =		{10.4230/LIPIcs.FSTTCS.2011.252},
  annote =	{Keywords: dependence logic, counting hierarchy, majority quantifier, second order logic, descriptive complexity, finite model theory}
}

Keywords: dependence logic, counting hierarchy, majority quantifier, second order logic, descriptive complexity, finite model theory
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Issue Date: 2011
Date of publication: 01.12.2011


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI