Modus Tollens and Counterfactuals and Counterfactual Reasoning Based on Three Types of Negation

• URL: http://arxiv.org/abs/2609.07483v1
• Date: Mon, 07 Sep 2026 13:38:23 GMT
• Title: Modus Tollens and Counterfactuals and Counterfactual Reasoning Based on Three Types of Negation
• Abstract summary: We propose three variants of Modus Tollens corresponding to distinct negation types, namely MTC: Modus Tollens based on contradictory negation, MTO: Modus Tollens based on opposite negation, and MTI: Modus Tollens based on intermediary negation.<n>We show that the truth value algorithms for MTC, MTO and MTI can be as the truth value algorithms for the three counterfactuals reasoning based on different logical negations.
• Score: 0.6345523830122167
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Modus Tollens (MT) is a classical logical inference rule, while counterfactuals are hypothetical statements that are contrary to facts, and counterfactual reasoning is a process of reasoning based on counterfactuals. Negation is an indispensable core concept in them. In this paper, based on the logical systems LCOI&PLCOI with contradictory negation, opposite negation and intermediary negation, we propose three variants of Modus Tollens corresponding to distinct negation types, namely MTC: Modus Tollens based on contradictory negation, MTO: Modus Tollens based on opposite negation, and MTI: Modus Tollens based on intermediary negation. We define the implications within MTC, MTO and MTI, provide the truth value algorithms of MTC, MTO and MTI, and discuss the reducibility of these algorithms. To incorporate these three types of negation into counterfactuals and counterfactual reasoning, we differentiate counterfactuals into two types based on whether they possess logical negation, thereby proposing three counterfactuals and counterfactuals reasoning based on different logical negations. In this paper, we further argue that the three counterfactuals reasoning based on different logical negations have the same inference form as MTC, MTO and MTI, respectively. In other words, they share the same inference structure. As a result, the truth value algorithms for MTC, MTO and MTI can be as the truth value algorithms for the three counterfactuals reasoning based on different logical negations. The algorithms indicates that if the first premise of the reasoning is true, the truth values of the reasoning conclusions are identical to the truth values of the three negative premises in the reasoning premises, respectively. This reflects the consistency and accuracy of the truth value algorithms.

Related papers

• Three Types of Negation of Triple and its Elements and an Extension of Triple [0.6345523830122167]
  The TCOI triple is a semantic and structural extension of the classical triple.<n>This paper explores the expressive power and reasoning of the TCOI triple, as well as the application of TCOI triple implication reasoning in counterfactuals and counterfactual reasoning.
  arXiv  Detail & Related papers  (2026-09-08T05:26:43Z)
• ARCHE: A Novel Task to Evaluate LLMs on Latent Reasoning Chain Extraction [70.53044880892196]
  We introduce a novel task named Latent Reasoning Chain Extraction (ARCHE), in which models must decompose complex reasoning arguments into combinations of standard reasoning paradigms in the form of a Reasoning Logic Tree (RLT)<n>To facilitate this task, we release ARCHE Bench, a new benchmark derived from 70 Nature Communications articles, including more than 1,900 references and 38,000 viewpoints.<n> Evaluations on 10 leading LLMs on ARCHE Bench reveal that models exhibit a trade-off between REA and EC, and none are yet able to extract a complete and standard reasoning chain.
  arXiv  Detail & Related papers  (2025-11-16T07:37:09Z)
• 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)
• 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)
• Three Kinds of Negation in Knowledge and Their Mathematical Foundations [4.343358400426713]
  We examine and analyze the understanding and characteristics of negation in various fields such as philosophy, logic, and linguistics.<n>Based on the distinction between the concepts of contradiction and opposition, we propose that there are three different types of negation in knowledge from a conceptual perspective.
  arXiv  Detail & Related papers  (2025-05-30T10:01:37Z)
• Learning to Reason via Mixture-of-Thought for Logical Reasoning [56.24256916896427]
  Mixture-of-Thought (MoT) is a framework that enables LLMs to reason across three complementary modalities: natural language, code, and truth-table.<n>MoT adopts a two-phase design: (1) self-evolving MoT training, which jointly learns from filtered, self-generated rationales across modalities; and (2) MoT inference, which fully leverages the synergy of three modalities to produce better predictions.
  arXiv  Detail & Related papers  (2025-05-21T17:59:54Z)
• Logical Negation Augmenting and Debiasing for Prompt-based Methods [19.879616265315637]
  We focus on the effectiveness of prompt-based methods on first-order logical reasoning. We find that the bottleneck lies in logical negation. We propose a simple but effective method, Negation Augmenting and Negation Debiasing.
  arXiv  Detail & Related papers  (2024-05-08T08:05:47Z)
• LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers [60.009969929857704]
  Logical reasoning is an important task for artificial intelligence with potential impacts on science, mathematics, and society. In this work, we reformulating such tasks as modular neurosymbolic programming, which we call LINC. We observe significant performance gains on FOLIO and a balanced subset of ProofWriter for three different models in nearly all experimental conditions we evaluate.
  arXiv  Detail & Related papers  (2023-10-23T17:58:40Z)
• Are Large Language Models Really Good Logical Reasoners? A Comprehensive Evaluation and Beyond [46.75497042978449]
  Large Language Models (LLMs) have emerged as a noteworthy innovation in natural language processing (NLP) We aim to bridge this gap and provide comprehensive evaluations in this paper. Considering the comprehensiveness of evaluations, we include 3 early-era representative LLMs and 4 trending LLMs.
  arXiv  Detail & Related papers  (2023-06-16T13:39:35Z)
• Certain and Uncertain Inference with Indicative Conditionals [0.3437656066916039]
  We develop a trivalent semantics for the truth conditions and the probability of the natural language conditional. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework. The result is a unified account of the semantics and indicative of conditionals that can be fruitfully applied to analyzing the validity of conditional inferences.
  arXiv  Detail & Related papers  (2022-07-17T20:06:00Z)
• Conversational Negation using Worldly Context in Compositional Distributional Semantics [0.0]
  Given a word, our framework can create its negation similar to how humans perceive negation. We propose and motivate a new logical negation using matrix inverse. We conclude that the combination of subtraction negation and phaser in the basis of the negated word yields the highest Pearson correlation of 0.635 with human ratings.
  arXiv  Detail & Related papers  (2021-05-12T16:04:36Z)
• Negation in Cognitive Reasoning [0.5801044612920815]
  Negation is an operation in formal logic and in natural language. One task of cognitive reasoning is answering questions given by sentences in natural language.
  arXiv  Detail & Related papers  (2020-12-23T13:22:53Z)

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.