On Strongly First-Order Dependencies
Logic
2014-03-18 v1 Logic in Computer Science
Abstract
We prove that the expressive power of first-order logic with team semantics plus contradictory negation does not rise beyond that of first-order logic (with respect to sentences), and that the totality atoms of arity k +1 are not definable in terms of the totality atoms of arity k. We furthermore prove that all first-order nullary and unary dependencies are strongly first order, in the sense that they do not increase the expressive power of first order logic if added to it.
Keywords
Cite
@article{arxiv.1403.3698,
title = {On Strongly First-Order Dependencies},
author = {Pietro Galliani},
journal= {arXiv preprint arXiv:1403.3698},
year = {2014}
}