On strongly first-order dependencies

DOI10.1007/978-3-319-31803-5_4MaRDI QIDQ5213641zbMATH OpenOpenAlexFDO

Authors Pietro Galliani

Publication date 4 February 2020

Published in Dependence Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.3698

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

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.

Recommendations

• Upwards closed dependencies in team semantics
• Upwards closed dependencies in team semantics
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Expressivity and Complexity of Dependence Logic
• The expressive power of modal dependence logic

Cites work

• scientific article; zbMATH DE number 6680142 (Why is no real title available?)
• A double team semantics for generalized quantifiers
• Characterizing quantifier extensions of dependence logic
• Compositional semantics for a language of imperfect information
• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• From IF to BI. A tale of dependence and separation
• Generalized quantifiers in dependence logic
• Hierarchies in Dependence Logic
• Hierarchies in independence logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Independence in database relations
• Proceedings of the fourth international symposium on games, automata, logics and formal verification, GandALF 2013, Borca di Cadore, Dolomites, Italy, August 29--31, 2013
• Team Logic and Second-Order Logic
• The doxastic interpretation of team semantics

Cited in

(15)

• Compactness in team semantics
• Separation logic and logics with team semantics
• Safe dependency atoms and possibility operators in team semantics
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• Doubly strongly first order dependencies
• Strongly first order, domain independent dependencies: the union-closed case
• scientific article; zbMATH DE number 7453077 (Why is no real title available?)
• A parameterized view on the complexity of dependence logic
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Upwards closed dependencies in team semantics
• scientific article; zbMATH DE number 7447734 (Why is no real title available?)
• Axiomatizations of team logics
• On elementary logics for quantitative dependencies
• On the complexity of team logic and its two-variable fragment
• Strongly dependent theories

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)