Upwards closed dependencies in team semantics

DOI10.1016/j.ic.2015.06.008zbMath1333.03089arXiv1305.4288OpenAlexW2962988080MaRDI QIDQ897651

Pietro Galliani

Publication date: 7 December 2015

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

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

zbMATH Keywords

dependence logicteam semanticsdependencies

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items (12)

Doubly strongly first order dependencies ⋮ On the Presburger fragment of logics with multiteam semantics ⋮ On definability of team relations with \(k\)-invariant atoms ⋮ Unnamed Item ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Unnamed Item ⋮ On the complexity of team logic and its two-variable fragment ⋮ Negation and partial axiomatizations of dependence and independence logic revisited ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES ⋮ Safe dependency atoms and possibility operators in team semantics ⋮ Team semantics for interventionist counterfactuals: observations vs. interventions ⋮ Canonical Models and the Complexity of Modal Team Logic

Cites Work

• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Axioms and algorithms for inferences involving probabilistic independence
• Dependence and independence
• Coherence and computational complexity of quantifier-free dependence logic formulas
• Generalized quantifiers in dependence logic
• A normal form for relational databases that is based on domains and keys
• Compositional semantics for a language of imperfect information
• Team Logic and Second-Order Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upwards closed dependencies in team semantics