The Logic of Approximate Dependence
Logic
2014-08-20 v1 Logic in Computer Science
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.
Cite
@article{arxiv.1408.4437,
title = {The Logic of Approximate Dependence},
author = {Jouko Väänänen},
journal= {arXiv preprint arXiv:1408.4437},
year = {2014}
}