Paper Info
Title
Strongly First Order, Domain Independent Dependencies: The Union-Closed Case
Abstract
Team Semantics generalizes Tarski’s Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via new kinds of connectives or atoms – most importantly, via dependency atoms that express dependencies between different assignments. Some of these extensions are more expressive than First Order Logic proper, while others are reducible to it. In this work, I provide necessary and sufficient conditions for a dependency atom that is domain independent (in the sense that its truth or falsity in a relation does not depend on the existence in the model of elements that do not occur in the relation) and union closed (in the sense that whenever it is satisfied by all members of a family of relations it is also satisfied by their union) to be strongly first order, in the sense that the logic obtained by adding them to First Order Logic is no more expressive than First Order Logic itself.
Year
DOI
Venue
2022
10.1007/978-3-031-15298-6_17
Logic, Language, Information, and Computation
Keywords
DocType
Volume
Team semantics, Dependence logic, First order logic
Conference
13468
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Pietro Galliani147.54