The logic of approximate dependence

DOI10.1007/978-3-319-47843-2_12zbMATH Open1437.03109arXiv1408.4437OpenAlexW1692931000MaRDI QIDQ3299846FDOQ3299846

Authors: Jouko Väänänen 

Publication date: 27 July 2020

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

Abstract: We extend the treatment of functional dependence, the basic concept of dependence logic, to include the possibility of dependence with a limited number of exceptions. We call this approximate dependence. The main result of the paper is a Completeness Theorem for approximate dependence atoms. We point out some problematic features of this which suggests that we should consider multi-teams, not just teams.

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

Recommendations

• Approximation and dependence via multiteam semantics
• Approximation and dependence via multiteam semantics
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Logics with multiteam semantics
• Dependence logic. A new approach to independence friendly logic

zbMATH Keywords

team semanticsapproximationdependence logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Cites Work

• Approximate inference of functional dependencies from relations
• Title not available (Why is that?)
• Finite information logic

Cited In (3)

• Approximation and dependence via multiteam semantics
• Approximation and dependence via multiteam semantics
• Multiteam semantics for interventionist counterfactuals: probabilities and causation

This page was built for publication: The logic of approximate dependence

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