In logic and mathematics, **or** is the truth-functional operator of (**inclusive**) **disjunction**, also known as **alternation**; the *or* of a set of operands is true if and only if *one or more* of its operands is true. The logical connective that represents this operator is typically written as ∨ or +.

is true if is true, or if is true, or if both and are true.

In logic, *or* by itself means the *inclusive* *or*, distinguished from an exclusive or, which is false when both of its arguments are true, while an "or" is true in that case.

An operand of a disjunction is called a **disjunct**.

Related concepts in other fields are:

- In natural language, the coordinating conjunction "or".
- In programming languages, the short-circuit or control structure.
- In set theory, union.
- In predicate logic, existential quantification.

Logical disjunction | |
---|---|

OR | |

Definition | |

Truth table | |

Normal forms | |

Disjunctive | |

Conjunctive | |

Zhegalkin polynomial | |

Post's lattices | |

0-preserving | yes |

1-preserving | yes |

Monotone | yes |

Affine | no |

Self-dual | no |

**Or** is usually expressed with an infix operator: in mathematics and logic, **∨**; in electronics, **+**; and in most programming languages, **|**, **||**, or **or**. In Jan Łukasiewicz's prefix notation for logic, the operator is **A**, for Polish *alternatywa* (English: alternative).^{[1]}

**Logical disjunction** is an operation on two logical values, typically the values of two propositions, that has 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 'or's. A single literal is often considered to be a degenerate disjunction.

The disjunctive identity is false, which is to say that the *or* of an expression with false has the same value as the original 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 generally defined as false.

The truth table of :

T | T | T |

T | F | T |

F | T | T |

F | F | F |

The following properties apply to disjunction:

**truth-preserving**: The interpretation under which all variables are assigned a truth value of 'true' produces a truth value of 'true' as a result of disjunction.**falsehood-preserving**: The interpretation under which all variables are assigned a truth value of 'false' produces a truth value of 'false' as a result of disjunction.

The mathematical symbol for logical disjunction varies in the literature. In addition to the word "or", and the formula "A*pq*", the symbol "", deriving from the Latin word *vel* (“either”, “or”) is commonly used for disjunction. For example: "*A* *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:

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

Operators corresponding to logical disjunction exist in most programming languages.

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.

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.

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

The membership of an element of a union set in set theory is defined in terms of a logical disjunction: *x* ∈ *A* ∪ *B* if and only if (*x* ∈ *A*) ∨ (*x* ∈ *B*). 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, identifying logical conjunction with set intersection, logical negation with set complement.

As with other notions formalized in mathematical logic, the meaning of the natural-language coordinating conjunction *or* is closely related to but different from the logical *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 either she's very bright or she studies hard" does not exclude the possibility of both. In other words, in ordinary language "or" (even if used with "either") can mean either the inclusive "or" [inclusive-]or the exclusive "or."

- George Boole, closely following analogy with ordinary mathematics, premised, as a necessary condition to the definition of "x + y", that x and y were mutually exclusive. Jevons, and practically all mathematical logicians after him, advocated, on various grounds, the definition of "logical addition" in a form which does not necessitate mutual exclusiveness.

**^**Józef Maria Bocheński (1959),*A Précis of Mathematical Logic*, translated by Otto Bird from the French and German editions, Dordrecht, North Holland: D. Reidel, passim.

- Hazewinkel, Michiel, ed. (2001) [1994], "Disjunction",
*Encyclopedia of Mathematics*, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4 - Aloni, Maria. "Disjunction". In Zalta, Edward N. (ed.).
*Stanford Encyclopedia of Philosophy*. - Eric W. Weisstein. "Disjunction." From MathWorld—A Wolfram Web Resource

- Alternative denial (NAND gate)
- Converse implication
- Implication (IMPLY gate)
- Disjunction (OR gate)
| ||

Logic portal |

This page is based on a Wikipedia article written by authors
(here).

Text is available under the CC BY-SA 3.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.