Strongly first order, domain independent dependencies: the union-closed case

DOI10.1007/978-3-031-15298-6_17MaRDI QIDQ6160748zbMATH OpenOpenAlexFDO

Authors Pietro Galliani

Publication date 2 June 2023

Published in Logic, Language, Information, and Computation (Search for Journal in Brave)

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

zbMATH Keywords

team semanticsdependence logicfirst order logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Abstract: Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via new kinds of connectives or atoms - most importantly, via dependency atoms that express dependencies between different assignments. Some of these extensions are more expressive than First Order Logic proper, while others are reducible to it. In this work, I provide necessary and sufficient conditions for a dependency atom that is domain independent (in the sense that its truth or falsity in a relation does not depend on the existence in the model of elements that do not occur in the relation) and union closed (in the sense that whenever it is satisfied by all members of a family of relations it is also satisfied by their union) to be strongly first order, in the sense that the logic obtained by adding them to First Order Logic is no more expressive than First Order Logic itself.

Recommendations

• On strongly first-order dependencies
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Characterizing strongly first order dependencies: the non-jumping relativizable case
• Doubly strongly first order dependencies
• First-order theories of abstract dependence relations
• scientific article; zbMATH DE number 4041341
• Axiomatizing first-order consequences in dependence logic
• Harnessing first order termination provers using higher order dependency pairs

Cites work

• scientific article; zbMATH DE number 6680142 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 4118333 (Why is no real title available?)
• scientific article; zbMATH DE number 7453077 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• A double team semantics for generalized quantifiers
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Compositional semantics for a language of imperfect information
• Decidability of predicate logics with team semantics
• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• Doubly strongly first order dependencies
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Logics for first-order team properties
• Logics with multiteam semantics
• On dependence logic
• On strongly first-order dependencies
• Probabilistic team semantics
• Safe dependency atoms and possibility operators in team semantics
• Upwards closed dependencies in team semantics

Cited in

(1)

• Doubly strongly first order dependencies

This page was built for publication: Strongly first order, domain independent dependencies: the union-closed case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160748)