{
  "id": "logical-disjunction",
  "title": "Logical Disjunction",
  "lang": "en",
  "source_lang": "en",
  "summary": "Logical disjunction is the connective “or,” classically true when at least one of its constituent propositions is true, including when both are true.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Disjunction",
    "Inclusive disjunction",
    "Inclusive OR",
    "Logical OR"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/logical-disjunction/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/logical-disjunction/",
      "json": "https://aiwiki.page/zh/logical-disjunction.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Logical disjunction is a connective in logic that combines propositions to express that at least one of them holds. It is usually written \\(P\\lor Q\\), read “\\(P\\) or \\(Q\\),” and its constituent propositions are called disjuncts. In classical propositional logic, a disjunction is false only when both disjuncts are false. This is an inclusive interpretation: \\(P\\lor Q\\) remains true when both \\(P\\) and \\(Q\\) are true."
    },
    {
      "heading": "Definition and truth conditions",
      "text": "Classical disjunction is a binary, truth-functional connective: the truth value of the compound proposition depends only on the truth values of its two disjuncts. Its truth table is:\n\n\\(P\\) | \\(Q\\) | \\(P\\lor Q\\)\nTrue | True | True\nTrue | False | True\nFalse | True | True\nFalse | False | False\n\nFor example, let \\(P\\) mean “the integer is divisible by 2” and \\(Q\\) mean “the integer is divisible by 3.” Then \\(P\\lor Q\\) is true of 4, 9, and 6, but false of 5. The case of 6 illustrates that both disjuncts may hold.\n\nIf truth is represented by \\(1\\) and falsity by \\(0\\), disjunction can be expressed as\n\n\\[p\\lor q=\\max(p,q)=p+q-pq, \\qquad p,q\\in\\{0,1\\}.\\]\n\nThe arithmetic expression on the right is an encoding of the truth table, not a replacement for the logical connective in ordinary formulas.\n\nInclusive and exclusive “or”\n\nInclusive disjunction differs from exclusive OR, which is true exactly when one disjunct is true and the other is false. Exclusive OR can be defined using inclusive disjunction:\n\n\\[P\\oplus Q \\equiv (P\\lor Q)\\land\\neg(P\\land Q).\\]\n\nHere \\(\\land\\) denotes logical conjunction, and \\(\\neg\\) denotes logical negation.\n\nIn ordinary language, “or” can suggest either interpretation. “Tea or coffee” may imply a choice of one, whereas “applicants must know French or German” may allow applicants who know both. The exclusive suggestion often depends on context rather than on the word “or” alone. Formal logic specifies the interpretation explicitly."
    },
    {
      "heading": "Notation and scope",
      "text": "The standard logical symbol for disjunction is \\(\\lor\\). In Boolean algebra, \\(+\\) is also commonly used for OR, with multiplication or juxtaposition representing AND. Boolean addition must not be confused with ordinary arithmetic addition or addition modulo 2: in Boolean OR, \\(1+1=1\\), whereas addition modulo 2 represents exclusive OR.\n\nParentheses determine the scope of a connective. For example,\n\n\\[P\\lor(Q\\land R)\\]\n\ndiffers from\n\n\\[(P\\lor Q)\\land R.\\]\n\nA common convention gives negation higher precedence than conjunction, and conjunction higher precedence than disjunction, but explicit parentheses avoid ambiguity.\n\nDisjunction also occurs inside first-order logic, where its disjuncts may contain predicates, variables, and quantifiers. For example,\n\n\\[\\forall x\\bigl(P(x)\\lor Q(x)\\bigr)\\]\n\nsays that every object satisfies at least one of the two predicates. It does not generally imply\n\n\\[(\\forall x\\,P(x))\\lor(\\forall x\\,Q(x)),\\]\n\nbecause different objects may satisfy different predicates."
    },
    {
      "heading": "Algebraic properties",
      "text": "Classical disjunction satisfies several fundamental equivalences. Here \\(\\equiv\\) means that the formulas have the same truth value under every assignment.\n\nProperty | Equivalence\nCommutativity | \\(P\\lor Q\\equiv Q\\lor P\\)\nAssociativity | \\((P\\lor Q)\\lor R\\equiv P\\lor(Q\\lor R)\\)\n[[idempotence | Idempotence]]\nIdentity | \\(P\\lor\\bot\\equiv P\\)\nDomination | \\(P\\lor\\top\\equiv\\top\\)\nAbsorption | \\(P\\lor(P\\land Q)\\equiv P\\)\n\nThe symbols \\(\\bot\\) and \\(\\top\\) represent falsity and truth, respectively.\n\nAssociativity allows a finite disjunction to be written without specifying its grouping:\n\n\\[P_1\\lor P_2\\lor\\cdots\\lor P_n.\\]\n\nIt is true exactly when at least one disjunct is true. The disjunction of no propositions—the empty disjunction—is conventionally false, consistently with \\(\\bot\\) being the identity for OR.\n\nDisjunction and conjunction distribute over one another:\n\n\\[P\\lor(Q\\land R) \\equiv (P\\lor Q)\\land(P\\lor R),\\]\n\n\\[P\\land(Q\\lor R) \\equiv (P\\land Q)\\lor(P\\land R).\\]\n\nDe Morgan’s laws connect these operations with negation:\n\n\\[\\neg(P\\lor Q)\\equiv\\neg P\\land\\neg Q,\\]\n\n\\[\\neg(P\\land Q)\\equiv\\neg P\\lor\\neg Q.\\]\n\nConsequently, in classical logic disjunction can be defined from conjunction and negation:\n\n\\[P\\lor Q\\equiv\\neg(\\neg P\\land\\neg Q).\\]\n\nThe law of excluded middle,\n\n\\[P\\lor\\neg P,\\]\n\nis a classical tautology. Some of these equivalences and principles do not extend unchanged to nonclassical logics."
    },
    {
      "heading": "Rules of inference",
      "text": "Disjunction is governed by rules specifying how it may be introduced and used in a formal proof.\n\nDisjunction introduction\n\nFrom \\(P\\), one may infer \\(P\\lor Q\\); from \\(Q\\), one may infer \\(P\\lor Q\\):\n\n\\[\\frac{P}{P\\lor Q} \\qquad \\frac{Q}{P\\lor Q}.\\]\n\nThese rules of inference require no evidence for the additional disjunct. If \\(P\\) is already established, the inclusive claim that at least one of \\(P\\) and \\(Q\\) holds is established as well.\n\nDisjunction elimination\n\nIn natural deduction, disjunction elimination formalizes proof by cases. If \\(P\\lor Q\\) is established, and the same conclusion \\(R\\) follows both from assuming \\(P\\) and from assuming \\(Q\\), then \\(R\\) follows:\n\n\\[\\frac{ P\\lor Q \\qquad \\begin{array}{c} [P]\\\\ \\vdots\\\\ R \\end{array} \\qquad \\begin{array}{c} [Q]\\\\ \\vdots\\\\ R \\end{array} }{R}.\\]\n\nThe bracketed assumptions are discharged when the rule is applied. The two cases need not be mutually exclusive: the argument remains valid if both \\(P\\) and \\(Q\\) hold.\n\nA familiar related pattern is disjunctive syllogism:\n\n\\[P\\lor Q,\\quad \\neg P \\quad\\Longrightarrow\\quad Q.\\]\n\nIt is valid in classical and standard intuitionistic logic. By contrast, \\(P\\lor Q\\) together with \\(P\\) does not justify \\(\\neg Q\\), because inclusive disjunction permits both disjuncts to be true."
    },
    {
      "heading": "Set-theoretic and probabilistic interpretations",
      "text": "In set theory, disjunction corresponds to union:\n\n\\[x\\in A\\cup B \\quad\\Longleftrightarrow\\quad (x\\in A)\\lor(x\\in B).\\]\n\nUnder this correspondence, conjunction becomes intersection and negation becomes complement relative to a specified universe. The algebraic laws for logical connectives therefore parallel laws for sets.\n\nIn a partial order derived from a Boolean algebra, disjunction is the join, or least upper bound. For propositions ordered by logical entailment, modulo logical equivalence, \\(P\\lor Q\\) is the weakest common upper bound: both \\(P\\) and \\(Q\\) entail it, and it entails every proposition entailed by both.\n\nIn probability theory, the occurrence of event \\(A\\) or event \\(B\\) is represented by \\(A\\cup B\\). Its probability is\n\n\\[\\Pr(A\\cup B) = \\Pr(A)+\\Pr(B)-\\Pr(A\\cap B).\\]\n\nThe subtraction prevents outcomes satisfying both events from being counted twice. For mutually exclusive events, the intersection has probability zero. Under statistical independence, the formula becomes\n\n\\[\\Pr(A\\cup B) = \\Pr(A)+\\Pr(B)-\\Pr(A)\\Pr(B).\\]\n\nIndependence and mutual exclusivity are distinct conditions."
    },
    {
      "heading": "Computation and applications",
      "text": "Disjunction is a basic operation in computer science. Digital circuits implement it using OR gates, whose output is 1 when at least one input is 1. Multi-input OR gates generalize the same rule.\n\nProgramming languages commonly distinguish:\n\n- Logical OR, which combines Boolean conditions, although operand and return-value conventions vary by language.\n- Bitwise OR, which applies the OR truth table independently to corresponding bits.\n- Short-circuit OR, which evaluates the second operand only when the first operand does not already establish a true result.\n\nShort-circuit evaluation matters when an operand has side effects, is computationally expensive, or would be invalid to evaluate in certain circumstances. Such evaluation behavior is not part of the abstract classical truth table.\n\nDisjunction is also central to standard forms for propositional formulas. A disjunctive normal form is a disjunction of conjunctions of literals, where a literal is a proposition variable or its negation. A conjunctive normal form is a conjunction of clauses, each clause being a disjunction of literals. These representations support satisfiability testing, automated reasoning, and formal verification."
    },
    {
      "heading": "Nonclassical interpretations",
      "text": "Intuitionistic logic\n\nIn intuitionistic logic, disjunction retains its introduction and elimination rules, but its meaning is not exhausted by a classical two-valued truth table. Under the Brouwer–Heyting–Kolmogorov interpretation, evidence for \\(P\\lor Q\\) identifies a disjunct and supplies evidence for that disjunct.\n\nAccordingly, intuitionistic logic has the disjunction property: if a closed formula \\(P\\lor Q\\) is provable in pure intuitionistic logic, then \\(P\\) is provable or \\(Q\\) is provable. Classical logic lacks this property; it proves \\(P\\lor\\neg P\\) without generally proving either disjunct.\n\nThe classical equivalence\n\n\\[P\\lor Q\\equiv\\neg(\\neg P\\land\\neg Q)\\]\n\ndoes not hold intuitionistically in general. The left side implies the right, but the converse is not generally derivable.\n\nThrough the Curry–Howard correspondence, constructive disjunction corresponds to a sum type: a value contains either an inhabitant of one type or an inhabitant of the other, together with an indication of which alternative it represents.\n\nOther nonclassical systems\n\nMany-valued logics may interpret disjunction as an operation on more than two truth values. The chosen operation and its interaction with negation depend on the system.\n\nIn paraconsistent logic, some familiar inference patterns require restriction. In particular, disjunctive syllogism may fail when a proposition and its negation can both hold without every proposition following."
    },
    {
      "heading": "Historical context",
      "text": "The distinction between different readings of “or” predates modern symbolic notation. The development of algebraic logic in the nineteenth century, particularly the work of George Boole, helped establish systematic algebraic methods for reasoning about propositions and classes. Later symbolic logic standardized disjunction as a basic connective, while the development of Boolean methods for switching circuits connected the same operation to digital computation."
    }
  ],
  "links": [
    "logic",
    "propositional-logic",
    "truth-table",
    "exclusive-or",
    "logical-conjunction",
    "logical-negation",
    "boolean-algebra",
    "first-order-logic",
    "idempotence",
    "de-morgans-laws",
    "law-of-excluded-middle",
    "formal-proof",
    "inference-rule",
    "natural-deduction",
    "set-theory",
    "partial-order",
    "probability",
    "statistical-independence",
    "computer-science",
    "formal-verification",
    "intuitionistic-logic",
    "bhk-interpretation",
    "curry-howard-correspondence",
    "paraconsistent-logic",
    "george-boole"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}