License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.35
URN: urn:nbn:de:0030-drops-65757
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6575/
Grädel, Erich ;
Hegselmann, Stefan
Counting in Team Semantics
Abstract
We explore several counting constructs for logics with team semantics. Counting is an important task in numerous applications, but with a somewhat delicate relationship to logic. Team semantics on the other side is the mathematical basis of modern logics of dependence and independence, in which formulae are evaluated not for a single assignment of values to variables, but for a set of such assignments. It is therefore interesting to ask what kind of counting constructs are adequate in this context, and how such constructs influence the expressive power, and the model-theoretic and algorithmic properties of logics with team semantics. Due to the second-order features of team semantics there is a rich variety of potential counting constructs. Here we study variations of two main ideas: forking atoms and counting quantifiers.
Forking counts how many different values for a tuple w occur in assignments with coinciding values for v. We call this the forking degree of bar v with respect to bar w. Forking is powerful enough to capture many of the previously studied atomic dependency properties. In particular we exhibit logics with forking atoms that have, respectively, precisely the power of dependence logic and independence logic.
Our second approach uses counting quantifiers E^{geq mu} of a similar kind as used in logics with Tarski semantics. The difference is that these quantifiers are now applied to teams of assignments that may give different values to mu. We show that, on finite structures, there is an intimate connection between inclusion logic with counting quantifiers and FPC, fixed-point logic with counting, which is a logic of fundamental importance for descriptive complexity theory. For sentences, the two logics have the same expressive power. Our analysis is based on a new variant of model-checking games, called threshold safety games, on a trap condition for such games, and on game interpretations.
BibTeX - Entry
@InProceedings{grdel_et_al:LIPIcs:2016:6575,
author = {Erich Gr{\"a}del and Stefan Hegselmann},
title = {{Counting in Team Semantics}},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
pages = {35:1--35:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
year = {2016},
volume = {62},
editor = {Jean-Marc Talbot and Laurent Regnier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6575},
URN = {urn:nbn:de:0030-drops-65757},
doi = {10.4230/LIPIcs.CSL.2016.35},
annote = {Keywords: logics with counting, team semantics, fixed-point logic with counting}
}
|
Keywords: |
|
logics with counting, team semantics, fixed-point logic with counting |
|
Collection: |
|
25th EACSL Annual Conference on Computer Science Logic (CSL 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
29.08.2016 |
