Paper Info
Title
Safe Dependency Atoms and Possibility Operators in Team Semantics.
Abstract
I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in the sense that they do not increase its expressive power over sentences when added to it. I show that some dependencies, like totality, non-constancy and non-emptiness, are safe for all logics FO(D), and that other dependencies, like constancy, are not safe for FO(D) for some choices of D despite being strongly first order (that is, safe for FO(empty set)). I furthermore show that the possibility operator lozenge phi, which holds in a team if and only if phi holds in some nonempty subteam, can be added to any logic FO(D) without increasing its expressive power over sentences.
Year
DOI
Venue
2018
10.4204/EPTCS.277.5
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
Field
DocType
Volume
Programming language,Computer science,Operator (computer programming),Semantics
Journal
abs/1808.00710
Issue
ISSN
Citations 
277
2075-2180
1
PageRank 
References 
Authors
0.35
0
1
Name
Order
Citations
PageRank
Pietro Galliani147.54