# Logical disjunction

"Disjunction" redirects here. For the logic gate, see OR gate. For separation of chromosomes, see Meiosis. For disjunctions in distribution, see Disjunct distribution.
Venn diagram of $\scriptstyle A \or B$
Venn diagram of $\scriptstyle A \or B \or C$

In logic and mathematics, or is a truth-functional operator also known as (inclusive) disjunction and alternation. The logical connective that represents this operator is also known as "or", and typically written as $\lor$ or $+$. The "or" operator produces a result of true whenever one or more of its operands are true. For example, in this context, "A or B" is true if A is true, or if B is true, or if both A and B are true. In grammar, or is a coordinating conjunction. An operand of a disjunction is called a disjunct.

The "or" operator differs from the exclusive or in that the latter returns false when both of its inputs are true, while "or" returns true. In ordinary language, outside of contexts such as formal logic, mathematics and programming, "or" sometimes has the meaning of "exclusive or". For example, "Please ring me or send an email" likely means "do one or the other, but not both". On the other hand, "Her grades are so good that she's either very bright or studies hard" allows for the possibility that the person is both bright and works hard. In other words, in ordinary language "or" can mean inclusive or exclusive or. Usually the intended meaning is clear from the context.

## Notation

Or is usually expressed with the prefix operator A, or with an infix operator. In mathematics and logic, the infix operator is usually ; in electronics, +; and in programming languages, | or or. Some programming languages have a related control structure, the short-circuit or, written ||, or else, etc.

## Definition

Logical disjunction is an operation on two logical values, typically the values of two propositions, that produces a value of false if and only if both of its operands are false. More generally a disjunction is a logical formula that can have one or more literals separated only by ORs. A single literal is often considered to be a degenerate disjunction.

The disjunctive identity is 0, which is to say that OR-ing an expression with 0 will never change the value of the expression. In keeping with the concept of vacuous truth, when disjunction is defined as an operator or function of arbitrary arity, the empty disjunction (OR-ing over an empty set of operands) is often defined as having the result 0.

### Truth table

Disjunctions of the arguments on the left
The false bits form a Sierpinski triangle

The truth table of $~A \or B$:

 INPUT OUTPUT $A$ $B$ $A \or B$ T T T T F T F T T F F F

## Properties

 $A \or B$ $\Leftrightarrow$ $B \or A$ $\Leftrightarrow$
 $~A$ $~~~\or~~~$ $(B \or C)$ $\Leftrightarrow$ $(A \or B)$ $~~~\or~~~$ $~C$ $~~~\or~~~$ $\Leftrightarrow$ $\Leftrightarrow$ $~~~\or~~~$
 $~A$ $\or$ $(B \and C)$ $\Leftrightarrow$ $(A \or B)$ $\and$ $(A \or C)$ $\or$ $\Leftrightarrow$ $\Leftrightarrow$ $\and$
 $~A~$ $~\or~$ $~A~$ $\Leftrightarrow$ $A~$ $~\or~$ $\Leftrightarrow$
 $A \rightarrow B$ $\Rightarrow$ $(A \or C)$ $\rightarrow$ $(B \or C)$ $\Rightarrow$ $\Leftrightarrow$ $\rightarrow$

When all inputs are true, the output is true.

 $A \and B$ $\Rightarrow$ $A \or B$ $\Rightarrow$ (to be tested)

When all inputs are false, the output is false.

 $A \or B$ $\Rightarrow$ $A \or B$ $\Rightarrow$ (to be tested)

If using binary values for true (1) and false (0), then logical disjunction works almost like binary addition. The only difference is that $1\or 1=1$, while $1+1=10$.

## Symbol

The mathematical symbol for logical disjunction varies in the literature. In addition to the word "or", and the formula "Apq", the symbol "$\or$", deriving from the Latin word vel (“either”, “or”) is commonly used for disjunction. For example: "A $\or$ B " is read as "A or B ". Such a disjunction is false if both A and B are false. In all other cases it is true.

All of the following are disjunctions:

$A \or B$
$\neg A \or B$
$A \or \neg B \or \neg C \or D \or \neg E.$

The corresponding operation in set theory is the set-theoretic union.

## Applications in computer science

Operators corresponding to logical disjunction exist in most programming languages.

### Bitwise operation

Disjunction is often used for bitwise operations. Examples:

• 0 or 0 = 0
• 0 or 1 = 1
• 1 or 0 = 1
• 1 or 1 = 1
• 1010 or 1100 = 1110

The or operator can be used to set bits in a bit field to 1, by or-ing the field with a constant field with the relevant bits set to 1. For example, x = x | 0b00000001 will force the final bit to 1 while leaving other bits unchanged.

### Logical operation

Many languages distinguish between bitwise and logical disjunction by providing two distinct operators; in languages following C, bitwise disjunction is performed with the single pipe (|) and logical disjunction with the double pipe (||) operators.

Logical disjunction is usually short-circuited; that is, if the first (left) operand evaluates to true then the second (right) operand is not evaluated. The logical disjunction operator thus usually constitutes a sequence point.

In a parallel (concurrent) language, it is possible to short-circuit both sides: they are evaluated in parallel, and if one terminates with value true, the other is interrupted. This operator is thus called the parallel or.

Although in most languages the type of a logical disjunction expression is boolean and thus can only have the value true or false, in some (such as Python and JavaScript) the logical disjunction operator returns one of its operands: the first operand if it evaluates to a true value, and the second operand otherwise.

### Constructive disjunction

The Curry–Howard correspondence relates a constructivist form of disjunction to tagged union types.

## Union

The membership of an element of an union set in set theory is defined in terms of a logical disjunction: xAB if and only if (xA) ∨ (xB). Because of this, logical disjunction satisfies many of the same identities as set-theoretic union, such as associativity, commutativity, distributivity, and de Morgan's laws.