On Strongly First-Order Dependencies
classification
🧮 math.LO
cs.LO
keywords
first-orderlogicarityatomsdependenciesexpressivefirstorder
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.