Representation Theorems for Cumulative Propositional Dependence Logics

• URL: http://arxiv.org/abs/2602.21360v1
• Date: Tue, 24 Feb 2026 20:45:01 GMT
• Title: Representation Theorems for Cumulative Propositional Dependence Logics
• Authors: Juha Kontinen, Arne Meier, Kai Sauerwald,
• Abstract summary: We prove representation theorems for cumulative propositional dependence logic and cumulative propositional logic with team semantics.<n>For propositional dependence logic, we show that System C entailments are exactly captured by cumulative models from Kraus, Lehmann and Magidor.<n>On the other hand, we show that entailment in cumulative propositional logics with team semantics is exactly captured by cumulative and asymmetric models.
• Score: 5.3909333359654275
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Are Language Models Efficient Reasoners? A Perspective from Logic Programming [109.47572890883248]
  Modern language models (LMs) exhibit strong deductive reasoning capabilities, yet standard evaluations emphasize correctness while overlooking a key aspect of human-like reasoning: efficiency.<n>We propose a framework for assessing LM reasoning efficiency through the lens of logic programming.
  arXiv  Detail & Related papers  (2025-10-29T15:30:31Z)
• DivLogicEval: A Framework for Benchmarking Logical Reasoning Evaluation in Large Language Models [58.439517684779936]
  This paper proposes a new classical logic benchmark DivLogicEval, consisting of natural sentences composed of diverse statements in a counterintuitive way.<n>To ensure a more reliable evaluation, we also introduce a new evaluation metric that mitigates the influence of bias and randomness inherent in Large Language Models.
  arXiv  Detail & Related papers  (2025-09-19T04:40:46Z)
• Reasoning is about giving reasons [55.56111618153049]
  We show that we can identify and extract the logical structure of natural language arguments in three popular reasoning datasets with high accuracies.<n>Our approach supports all forms of reasoning that depend on the logical structure of the natural language argument.
  arXiv  Detail & Related papers  (2025-08-20T07:26:53Z)
• On the Complexity and Properties of Preferential Propositional Dependence Logic [3.1952340441132474]
  Preferential team-based reasoning is shown to be cumulative, yet violates SystemP.<n>We show that these characterisations do, surprisingly, not carry over to preferential team-based propositional logic.
  arXiv  Detail & Related papers  (2025-05-13T12:54:59Z)
• Propositional Measure Logic [0.0]
  We present a propositional logic with fundamental probabilistic semantics.<n>This semantics replaces the binarity of classical logic, while preserving its deductive structure.<n>We demonstrate the soundness theorem, establishing that the proposed system is sound and suitable for reasoning under uncertainty.
  arXiv  Detail & Related papers  (2025-04-24T16:21:16Z)
• A Primer for Preferential Non-Monotonic Propositional Team Logics [0.0]
  We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated by the non-classical interpretation of disjunction in team semantics, we give a precise characterization for preferential models for propositional dependence logic.
  arXiv  Detail & Related papers  (2024-05-11T09:53:15Z)
• Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
  Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence) We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs) The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
  arXiv  Detail & Related papers  (2022-07-04T14:38:49Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• A natural deduction system for orthomodular logic [0.0]
  Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. It is shown to be a nonlinear noncommutative logic. It is extended to two systems of predicate logic: the first is sound for Takeuti's quantum set theory, and the second is sound for a variant of Weaver's quantum logic.
  arXiv  Detail & Related papers  (2021-09-11T22:28:17Z)
• Uncertain Linear Logic via Fibring of Probabilistic and Fuzzy Logic [0.0]
  probabilistic and fuzzy logic correspond to two different assumptions regarding the combination of propositions whose evidence bases are not currently available. It is shown that these two sets of formulas provide a natural grounding for the multiplicative and additive operator-sets in linear logic. The concept of linear logic as a logic of resources" is manifested here via the principle of conservation of evidence"
  arXiv  Detail & Related papers  (2020-09-28T00:19:42Z)
• Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
  We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic. Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
  arXiv  Detail & Related papers  (2020-08-06T02:13:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.