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

DOI10.1007/978-3-031-15298-6_17arXiv2205.06466OpenAlexW4297809199MaRDI QIDQ6160748FDOQ6160748

Authors: Pietro Galliani 

Publication date: 2 June 2023

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

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.

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

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

zbMATH Keywords

team semanticsdependence logicfirst order logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Probabilistic team semantics
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A double team semantics for generalized quantifiers
• Title not available (Why is that?)
• On dependence logic
• Doubly strongly first order dependencies
• On strongly first-order dependencies
• Logics for first-order team properties
• Decidability of predicate logics with team semantics
• Logics with multiteam semantics
• Safe dependency atoms and possibility operators in team semantics
• Upwards closed dependencies in team semantics
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Title not available (Why is that?)

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)