On strongly first-order dependencies
From MaRDI portal
Publication:5213641
DOI10.1007/978-3-319-31803-5_4zbMATH Open1429.03116arXiv1403.3698OpenAlexW1482215821MaRDI QIDQ5213641FDOQ5213641
Authors: Pietro Galliani 
Publication date: 4 February 2020
Published in: Dependence Logic (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1403.3698
Recommendations
Cites Work
- Dependence and independence
- Dependence logic. A new approach to independence friendly logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Compositional semantics for a language of imperfect information
- Independence in database relations
- The doxastic interpretation of team semantics
- From IF to BI. A tale of dependence and separation
- Generalized quantifiers in dependence logic
- Hierarchies in independence logic
- Title not available (Why is that?)
- A double team semantics for generalized quantifiers
- Characterizing quantifier extensions of dependence logic
- Hierarchies in Dependence Logic
- Team Logic and Second-Order Logic
- Proceedings of the fourth international symposium on games, automata, logics and formal verification, GandALF 2013, Borca di Cadore, Dolomites, Italy, August 29--31, 2013
- Hierarchies in Inclusion Logic with Lax Semantics
Cited In (16)
- Title not available (Why is that?)
- Strongly first order, domain independent dependencies: the union-closed case
- Compactness in team semantics
- Separation logic and logics with team semantics
- Characterizing downwards closed, strongly first-order, relativizable dependencies
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
- Title not available (Why is that?)
- Axiomatizations of team logics
- Strongly dependent theories
- A parameterized view on the complexity of dependence logic
- Upwards closed dependencies in team semantics
- On elementary logics for quantitative dependencies
- Safe dependency atoms and possibility operators in team semantics
- On the complexity of team logic and its two-variable fragment
- Doubly strongly first order dependencies
- Negation and partial axiomatizations of dependence and independence logic revisited
This page was built for publication: On strongly first-order dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5213641)
