Source-linked AI summary
Modus Tollens and Counterfactuals and Counterfactual Reasoning Based on Three Types of Negation
Zhenghua Pan
TL;DR
The paper addresses how different forms of negation should be represented in Modus Tollens and counterfactual reasoning. Using LCOI&PLCOI, it defines three negation-specific Modus Tollens variants and corresponding counterfactual forms, showing that their inference structures and truth-value algorithms correspond.
Problem
Negation is central to Modus Tollens and counterfactual reasoning, but counterfactual reasoning does not rely on a single semantic model of negation.
Method
Using LCOI&PLCOI, the paper formalizes contradictory, opposite, and intermediary negation through MTC, MTO, and MTI and extends them to counterfactual reasoning.
Results
The three counterfactual reasoning forms have the same inference structures as MTC, MTO, and MTI, respectively, allowing their truth-value algorithms to be shared.
Takeaways & Limitations
When the first premise is true, each counterfactual reasoning conclusion has the same truth value as the corresponding negative premise.
Takeaways & Limitations
The proposed three-negation forms are identified as a basis for future extension to fuzzy Modus Tollens and fuzzy counterfactual reasoning.
Abstract
from arXiv · showhide
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.
1 Introduction
Negation is central to Modus Tollens and counterfactual reasoning, but its semantic complexity and multiple logical forms remain challenging. The paper addresses this by developing three negation-specific Modus Tollens variants and corresponding counterfactual reasoning forms within LCOI&PLCOI.
- Motivation: Negation is semantically complex, takes diverse linguistic forms, and remains unresolved in computational processing.This complexity has made negation a continuing research focus across knowledge domains.
- Motivation: Modus Tollens derives a negated antecedent from a conditional and a denied consequent, making negation central to its inference structure.Its basic form is If P then Q, not Q, therefore not P.
- Motivation: Counterfactual reasoning constructs hypothetical premises contrary to facts and uses negation to explore possible outcomes or inferences.Its negation semantics may involve non-classical, possible-world, conditional, causal, or modal logic.
- Research gap: Prior work distinguishes forms such as strong and weak negation, while other research has not fully differentiated negations or established their theoretical foundations.The paper positions its approach as addressing this unresolved theoretical distinction.
- Contributions: The paper develops MTC, MTO, and MTI within LCOI&PLCOI and proposes three corresponding counterfactual reasoning forms based on contradictory, opposite, and intermediary negation.It also provides implications, truth-value algorithms, reducibility discussions, and an analysis of shared inference structures.
2 Three types of negation in knowledge and their characteristics
The paper distinguishes contradictory, opposite, and intermediary negation in both clear and fuzzy concepts, characterizing each through conceptual and extensional relationships. Examples involving integers and times of day illustrate these distinctions.
- Clear and fuzzy concepts: The three negation types occur in both clear and fuzzy concepts, differing in whether extensions are clear or unclear.The paper labels the corresponding cases CNC, ONC, INC, CNF, ONF, and INF.
- Three negation types: Contradictory negation pairs mutually exclusive concepts whose extensions together equal the genus concept.The paper treats classical logical negation as contradictory negation.
- Three negation types: Opposite negation pairs concepts with maximally different intensions but nonexclusive extensions whose sum is less than the genus extension.Positive versus negative integers and daytime versus night exemplify this relation.
- Three negation types: Intermediary negation connects opposite concepts through an intermediary, with the three extensions together equaling the genus extension.Zero mediates between positive and negative integers, while dusk mediates between daytime and night.
- Illustrative examples: The examples use positive and non-positive integers for contradiction, positive and negative integers for opposition, and integer zero as an intermediary.For fuzzy concepts, daytime and non-daytime instantiate contradiction, daytime and night opposition, and dusk intermediary negation.
3 Logic with three kinds of negation
The paper formalizes three negations in propositional and predicate logic through LCOI and PLCOI. Their infinity-valued semantics support soundness and completeness for the resulting logical systems.
- Formal systems: LCOI and PLCOI are mathematical systems designed to represent contradictory, opposite, and intermediary negation.LCOI is propositional logic, while PLCOI extends it with predicates, individual words, and quantifiers.
- LCOI syntax: The formal language includes separate symbols for contradictory, opposite, and intermediary negation alongside disjunction, conjunction, implication, and formal deduction.Formulas are built from atomic propositions using these operators.
- LCOI syntax: LCOI specifies axioms and deduction rules, including modus ponens, to define propositional reasoning with the three negations.The formal deduction system is explicitly named LCOI.
- PLCOI: PLCOI adds quantified predicate reasoning through universal and existential axioms, quantifier rules, and a generalization rule.The rule D3 derives a universal statement when a formula involving a fresh individual constant has been deduced.
- Semantics: An infinity-valued interpretation maps formulas to [0, 1] and assigns contradictory negation complementary values satisfying ∂(A)+∂(╕A)=1.The semantics also define values for implication, disjunction, conjunction, and the other negations.
- Meta-theory: The paper states soundness and completeness theorems for formulas and sets of formulas in LCOI and PLCOI.Both derivability-to-validity and validity-to-derivability directions are given.
4 Modus Tollens based on three types of negation
The paper extends Modus Tollens within LCOI&PLCOI by distinguishing contradictory, opposite, and intermediary negation. It formalizes the resulting inference variants, defines their implication requirements, and establishes reducibility results under an NR-implication condition.
- Three Modus Tollens variants: The three variants arise because LCOI&PLCOI differentiates knowledge into contradictory, opposite, and intermediary negation.The paper frames these negation types within the LCOI&PLCOI logical system.
- Formal derivations: Theorems 2–4 formally prove the three inference patterns in LCOI&PLCOI.The proofs derive each negated antecedent from the implication and its matching negated consequent, with Theorem 1’s soundness supporting their deductive validity.
- Three Modus Tollens variants: MTC, MTO, and MTI derive contradictory, opposite, and intermediary negations of A from A→B and the corresponding negation of B.Their formal forms are A→B, B ⇒ A; A→B, ╕B ⇒ ╕A; and A→B, B ⇒ A.
- Implication and negation: The implication IR is defined through a t-norm supremum and is required to satisfy contraposition symmetry with negation N.The paper also introduces NR-implication INR, which is explicitly related to N and satisfies INR(x, y) = IR(N(y), N(x)).
- Algorithms and reducibility: If IR ≤ INR, the algorithms for MTC, MTO, and MTI are reducible under their respective negations.The paper states this condition for contradictory negation in MTC, opposite negation in MTO, and intermediary negation in MTI.
5 Counterfactuals and counterfactual reasoning based on three types of negation
The paper extends counterfactuals and counterfactual reasoning beyond a single negation model by using contradictory, opposite, and intermediary negation in LCOI&PLCOI. It defines three corresponding counterfactual forms and shows that their reasoning shares the inference structures and truth-value algorithms of MTC, MTO, and MTI.
- Counterfactual classification: The paper distinguishes counterfactual conditionals with logical negation from those without logical negation.With logical negation, the counterfactual premise negates the factual consequent and its conclusion negates the factual antecedent.
- Three counterfactuals: LCOI&PLCOI yields three counterfactual conditionals based on contradictory, opposite, and intermediary negation.For a factual conditional F: A→B, they are C: B→A, C╕: ╕B→╕A, and C: B→A.
- Three counterfactuals: The paper proposes CR, CR╕, and CR as counterfactual reasoning systems corresponding to the three negation types.These systems reason from A→B together with the relevant negation of B to conclude the corresponding negation of A.
- Inference correspondence: The three counterfactual reasoning systems have the same inference structure as MTC, MTO, and MTI, respectively.This structural correspondence allows the truth-value algorithms for the three Modus Tollens variants to be used for the corresponding counterfactual reasoning systems.
- Truth-value algorithms: When A→B is true, each counterfactual reasoning conclusion has the same truth value as the corresponding negated B premise.Thus, ∂(A)=∂(B), ∂(╕A)=∂(╕B), and ∂(A)=∂(B).
- Truth-value algorithms: For the worked scenarios, the resulting truth values vary according to whether ∂(A)=0 or ∂(B)=1 and to the threshold parameter λ.The paper reports distinct values for contradictory, opposite, and intermediary negations under these cases.
6 Conclusions and future work
The paper extends Modus Tollens and counterfactual reasoning to contradictory, opposite, and intermediary negation within LCOI&PLCOI. It argues that the resulting counterfactual reasoning shares the corresponding inference structures and truth-value algorithms of MTC, MTO, and MTI.
- Conclusions: MTCOI proposes MTC, MTO, and MTI for contradictory, opposite, and intermediary negation, respectively.The paper also discusses their implications, truth-value algorithms, and algorithmic reducibility.
- Conclusions: Counterfactual conditionals are differentiated by whether they contain logical negation, yielding three negation-specific counterfactual reasoning types.These types are based on contradictory, opposite, and intermediary negation in LCOI&PLCOI.
- Conclusions: The three counterfactual reasoning types have the same inference forms as MTC, MTO, and MTI, respectively.
- Conclusions: When the first premise is true, each reasoning conclusion has the truth value of its corresponding negative premise.The paper presents this correspondence as evidence of consistency and accuracy in the truth-value algorithms.
- Future work: Future work will examine fuzzy counterfactuals, Counterfactual Collaborative Reasoning, and causal reasoning within knowledge systems.