Representation Theorems for Cumulative Propositional Dependence Logics
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912925701111808 |
|---|---|
| author | Kontinen, Juha Meier, Arne Sauerwald, Kai |
| author_facet | Kontinen, Juha Meier, Arne Sauerwald, Kai |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_21360 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Representation Theorems for Cumulative Propositional Dependence Logics Kontinen, Juha Meier, Arne Sauerwald, Kai Logic in Computer Science Artificial Intelligence 03B70, 03B62 I.2.3; F.4.1 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. |
| title | Representation Theorems for Cumulative Propositional Dependence Logics |
| topic | Logic in Computer Science Artificial Intelligence 03B70, 03B62 I.2.3; F.4.1 |
| url | https://arxiv.org/abs/2602.21360 |