Upwards closed dependencies in team semantics

DOI10.1016/J.IC.2015.06.008zbMATH Open1333.03089arXiv1305.4288OpenAlexW2962988080MaRDI QIDQ897651FDOQ897651

Authors: Pietro Galliani 

Publication date: 7 December 2015

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

Abstract: We prove that adding upwards closed first-order dependency atoms to first-order logic with team semantics does not increase its expressive power (with respect to sentences), and that the same remains true if we also add constancy atoms. As a consequence, the negations of functional dependence, conditional independence, inclusion and exclusion atoms can all be added to first-order logic without increasing its expressive power. Furthermore, we define a class of bounded upwards closed dependencies and we prove that unbounded dependencies cannot be defined in terms of bounded ones.

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

Recommendations

• Upwards closed dependencies in team semantics
• Polyteam semantics
• Polyteam semantics
• Safe dependency atoms and possibility operators in team semantics
• scientific article; zbMATH DE number 7447734
• Probabilistic team semantics
• The doxastic interpretation of team semantics
• Iterated team semantics for a hierarchy of informational types
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Approximation and dependence via multiteam semantics

zbMATH Keywords

team semanticsdependence logicdependencies

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Cites Work

• Axioms and algorithms for inferences involving probabilistic independence
• 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
• Independence-friendly logic. A game-theoretic approach
• Compositional semantics for a language of imperfect information
• Title not available (Why is that?)
• A normal form for relational databases that is based on domains and keys
• Title not available (Why is that?)
• Generalized quantifiers in dependence logic
• Title not available (Why is that?)
• Team Logic and Second-Order Logic
• Coherence and computational complexity of quantifier-free dependence logic formulas

Cited In (15)

• Title not available (Why is that?)
• Strongly first order, domain independent dependencies: the union-closed case
• Canonical models and the complexity of modal team logic
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Title not available (Why is that?)
• Team semantics for interventionist counterfactuals: observations vs. interventions
• Upwards closed dependencies in team semantics
• On definability of team relations with \(k\)-invariant atoms
• On the Presburger fragment of logics with multiteam semantics
• On the succinctness of atoms of dependency
• Safe dependency atoms and possibility operators in team semantics
• On strongly first-order dependencies
• 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: Upwards closed dependencies in team semantics

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