{
  "id": "disjunctive-syllogism",
  "title": "Disjunctive Syllogism",
  "lang": "en",
  "source_lang": "en",
  "summary": "Disjunctive syllogism is an inference rule that derives one alternative from a disjunction and the negation of the other.",
  "category": "philosophy",
  "subcategory": "metaphysics-epistemology",
  "type": "concept",
  "aliases": [
    "Modus tollendo ponens",
    "Disjunction elimination by denial"
  ],
  "generated_at": "2026-11-06",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/disjunctive-syllogism/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/disjunctive-syllogism/",
      "json": "https://aiwiki.page/zh/disjunctive-syllogism.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Disjunctive syllogism is a rule of deductive reasoning that infers one alternative from the assertion that at least one of two alternatives holds and the denial of the other. Its standard form is: “\\(P\\) or \\(Q\\); not \\(P\\); therefore \\(Q\\).” It is valid in classical logic and in standard intuitionistic logic, though not in every nonclassical logical system. The traditional Latin name, modus tollendo ponens, means roughly “the mode that affirms by denying.”"
    },
    {
      "heading": "Logical form",
      "text": "In propositional logic, the rule is written:\n\n\\[\\frac{P\\lor Q \\qquad \\neg P}{Q}.\\]\n\nHere \\(P\\) and \\(Q\\) represent arbitrary propositions, \\(\\lor\\) represents disjunction, and \\(\\neg\\) represents negation. The corresponding symmetric form is:\n\n\\[\\frac{P\\lor Q \\qquad \\neg Q}{P}.\\]\n\nFor example:\n\nThe document is in the cabinet or on the desk.\nThe document is not in the cabinet.\nTherefore, the document is on the desk.\n\nThe inference does not establish the disjunctive premise itself. Its validity consists in the impossibility, under the relevant logical interpretation, of the premises being true while the conclusion is false. An argument using the rule is sound only if its premises are also true.\n\nDespite its name, disjunctive syllogism is not a categorical syllogism of the familiar Aristotelian kind. Categorical syllogisms concern relations among classes expressed through quantified statements; disjunctive syllogism concerns the logical structure of whole propositions."
    },
    {
      "heading": "Why the inference is valid",
      "text": "In classical logic, an inclusive disjunction \\(P\\lor Q\\) is true when at least one of its disjuncts is true. If \\(\\neg P\\) is also true, \\(P\\) is false, so \\(Q\\) must be true.\n\nThe truth table displays this directly:\n\n\\(P\\) | \\(Q\\) | \\(P\\lor Q\\) | \\(\\neg P\\)\nTrue | True | True | False\nTrue | False | True | False\nFalse | True | True | True\nFalse | False | False | True\n\nThe only row in which both premises are true is the third, where the conclusion \\(Q\\) is also true. Thus:\n\n\\[P\\lor Q,\\ \\neg P \\models Q.\\]\n\nThe symbol \\(\\models\\) expresses semantic consequence. Equivalently, the following formula is a classical tautology:\n\n\\[\\bigl((P\\lor Q)\\land\\neg P\\bigr)\\to Q.\\]\n\nInclusive and exclusive “or”\n\nDisjunctive syllogism does not require an exclusive “or.” It works with the ordinary inclusive disjunction of classical logic, which allows both alternatives to be true. Denying one alternative eliminates that possibility and leaves the other.\n\nBy contrast, the inference\n\n\\[P\\lor Q,\\ P\\ \\therefore\\ \\neg Q\\]\n\nis invalid for inclusive disjunction: \\(P\\) and \\(Q\\) might both be true. This different inference becomes valid if the first premise explicitly states that exactly one alternative holds. Confusing the two patterns can produce a fallacy."
    },
    {
      "heading": "Place in proof systems",
      "text": "Some formal systems include disjunctive syllogism as a basic inference rule. Others derive it from more general rules.\n\nIn natural deduction, it can be obtained through proof by cases, using general disjunction elimination:\n\n- Assume \\(P\\lor Q\\) and \\(\\neg P\\).\n- Consider the case \\(P\\). Together with \\(\\neg P\\), this yields a contradiction, written \\(\\bot\\).\n- From \\(\\bot\\), infer \\(Q\\) by the rule of contradiction elimination.\n- Consider the case \\(Q\\). The desired conclusion is already available.\n- Since both cases yield \\(Q\\), conclude \\(Q\\).\n\nThis derivation distinguishes disjunctive syllogism from general disjunction elimination. The latter derives a conclusion \\(R\\) from \\(P\\lor Q\\) by showing that \\(R\\) follows from each disjunct separately. Disjunctive syllogism is a particular application in which one case is excluded by negation.\n\nThe same pattern appears as a special case of the resolution rule used in automated reasoning. Resolving the clauses \\(P\\lor Q\\) and \\(\\neg P\\) produces the unit clause \\(Q\\). This makes the inference useful in computer science, including automated theorem proving and some methods of formal verification."
    },
    {
      "heading": "Historical background",
      "text": "Disjunctive inference was studied in ancient Stoic logic, whose systematic development is especially associated with Chrysippus. The Stoic classification of basic argument forms included an inference from a disjunction and the negation of one alternative to the other, traditionally identified as the fourth “indemonstrable.”\n\nAn important qualification is that Stoic disjunction was generally understood as exclusive, whereas modern classical propositional logic usually takes \\(\\lor\\) to be inclusive. The inference from denying one alternative to affirming the other is valid under either interpretation, but other inferences involving disjunction depend on that distinction.\n\nThe Latin designation modus tollendo ponens belongs to the later logical vocabulary used to classify patterns of inference."
    },
    {
      "heading": "Nonclassical logic and explosion",
      "text": "Disjunctive syllogism is valid in standard intuitionistic logic. Its natural-deduction derivation does not require the law of excluded middle or unrestricted double-negation elimination. It does, however, use the principle that a contradiction permits the derivation of any conclusion.\n\nThis principle of explosion is central to the rule’s status in weaker and inconsistency-tolerant logics. Suppose a system permits both disjunction introduction and unrestricted disjunctive syllogism. From contradictory premises \\(P\\) and \\(\\neg P\\), an arbitrary \\(Q\\) follows:\n\n\\[\\begin{aligned} &1.\\quad P\\\\ &2.\\quad \\neg P\\\\ &3.\\quad P\\lor Q \\qquad \\text{from 1 by disjunction introduction}\\\\ &4.\\quad Q \\qquad \\text{from 3 and 2 by disjunctive syllogism}. \\end{aligned}\\]\n\nConsequently, a logic intended to tolerate contradictions without making every proposition derivable cannot retain both rules without qualification.\n\nMany systems of paraconsistent logic therefore reject unrestricted disjunctive syllogism. In some such systems, a proposition and its negation may both be true without every proposition being true. Under those semantics, \\(\\neg P\\) does not necessarily eliminate \\(P\\) as a true disjunct. Minimal logic, which omits contradiction elimination, likewise does not generally validate disjunctive syllogism."
    },
    {
      "heading": "Application and limitations",
      "text": "Disjunctive syllogism formalizes reasoning by elimination. For several alternatives, repeated application can reduce the possibilities to a single remaining option:\n\n\\[P\\lor Q\\lor R,\\quad \\neg P,\\quad \\neg Q \\quad\\therefore\\quad R.\\]\n\nThe crucial requirement is that the initial alternatives cover all relevant possibilities. An argument may have the valid disjunctive-syllogism form but rely on an unsupported disjunction. Presenting “Either \\(P\\) or \\(Q\\)” when further alternatives remain can create a false dilemma; that problem concerns the premise rather than the inference rule.\n\nLikewise, failure to establish \\(P\\) is not equivalent to establishing \\(\\neg P\\). In empirical inquiry, a test that fails to confirm one explanation may leave it unresolved rather than refuted. Disjunctive syllogism applies strictly only when the disjunction and the relevant negation are available as premises, not merely when one alternative seems less plausible."
    }
  ],
  "links": [
    "deductive-reasoning",
    "classical-logic",
    "propositional-logic",
    "proposition",
    "logical-disjunction",
    "logical-validity",
    "soundness",
    "syllogism",
    "logical-consequence",
    "tautology",
    "fallacy",
    "natural-deduction",
    "computer-science",
    "formal-verification",
    "stoicism",
    "chrysippus",
    "intuitionistic-logic",
    "paraconsistent-logic",
    "false-dilemma"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}