Upwards Closed Dependencies in Team Semantics

Pietro Galliani
(University of Helsinki)

We prove that adding upwards closed first-order dependency atoms to first-order logic with team semantics does not increase its expressive power (with respect to sentences), and that the same remains true if we also add constancy atoms. As a consequence, the negations of functional dependence, conditional independence, inclusion and exclusion atoms can all be added to first-order logic without increasing its expressive power.

Furthermore, we define a class of bounded upwards closed dependencies and we prove that unbounded dependencies cannot be defined in terms of bounded ones.

In Gabriele Puppis and Tiziano Villa: Proceedings Fourth International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2013), Borca di Cadore, Dolomites, Italy, 29-31th August 2013, Electronic Proceedings in Theoretical Computer Science 119, pp. 93–106.
Published: 16th July 2013.

ArXived at: https://dx.doi.org/10.4204/EPTCS.119.10 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org