On Dependence Logic

DOI10.1007/978-3-319-06025-5_4zbMath1325.03028arXiv1305.5948OpenAlexW1823487649MaRDI QIDQ5249667

Jouko Väänänen, Pietro Galliani

Publication date: 11 May 2015

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

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

zbMATH Keywords

independence-friendly logicdependence logiccompositional semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items

A finite axiomatization of conditional independence and inclusion dependencies ⋮ Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Axiomatizing first-order consequences in independence logic ⋮ LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE ⋮ Supervenience, Dependence, Disjunction ⋮ Explicating logical independence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Axiomatizing first-order consequences in dependence logic
• On interchangeability of Nash equilibria in multi-player strategic games
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• On definability in dependence logic
• From IF to BI. A tale of dependence and separation
• Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
• Inclusion dependencies and their interaction with functional dependencies
• Dependence and independence
• On the undecidability of implications between embedded multivalued database dependencies
• Independence in Database Relations
• A Fragment of Dependence Logic Capturing Polynomial Time
• Hierarchies in Dependence Logic
• Hierarchies in independence logic
• Modal Foundations for Predicate Logic
• Relational queries computable in polynomial time
• A normal form for relational databases that is based on domains and keys
• Compositional semantics for a language of imperfect information
• Finite Partially‐Ordered Quantifiers
• Finite partially-ordered quantification