Representation Theorems for Cumulative Propositional Dependence Logics
This work addresses foundational issues in logic for researchers in formal logic and AI, but it is incremental as it extends existing representation theorems to specific cumulative logics.
The paper tackles the problem of establishing representation theorems for cumulative propositional dependence logic and cumulative propositional logic with team semantics, showing that System C entailments are exactly captured by cumulative models and that entailment in team semantics is captured by cumulative and asymmetric models.
This paper establishes and proves representation theorems for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. Cumulative logics are famously given by System C. For propositional dependence logic, we show that System C entailments are exactly captured by cumulative models from Kraus, Lehmann and Magidor. On the other hand, we show that entailment in cumulative propositional logics with team semantics is exactly captured by cumulative and asymmetric models. For the latter, we also obtain equivalence with cumulative logics based on propositional logic with classical semantics. The proofs will be useful for proving representation theorems for other cumulative logics without negation and material implication.