The Logic of Approximate Dependence

2014/08/19 by Jouko Väänánen, Väänänen, Jouko · 2 citations
Business, Management and Accounting · Computer Science · #03B60 #Business Strategy and Innovation #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.1408.4437

openalex publication_date 2014/08/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• The flattening operator in team-based logics
• Axiomatizing approximate inclusion

Related

• Approximation and Dependence via Multiteam Semantics
• Dependence and Independence
• On Dependence Logic
• Finite Model Property and Bisimulation for LFD
• Logics of Dependence and Independence: The Local Variants