pith. sign in

arxiv: 1408.4437 · v1 · pith:IDA3EGNInew · submitted 2014-08-19 · 🧮 math.LO · cs.LO

The Logic of Approximate Dependence

classification 🧮 math.LO cs.LO
keywords dependenceapproximatelogicatomsbasiccallcompletenessconcept
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.