TeXipedia

vee

Represents the logical OR operation or disjunction in mathematical logic and set theory.

Overview

Essential in formal logic, boolean algebra, and mathematical proofs where logical operations need to be expressed precisely.

  • Commonly used in propositional logic to connect two statements.
  • Appears frequently in set theory to denote the union of sets.
  • Important in computer science and digital logic for expressing boolean operations.
  • Often paired with its dual operator wedge (conjunction) in logical expressions.

Examples

Logical OR operation in Boolean algebra

p∨q∨r=Truep \vee q \vee r = \text{True} 
p \vee q \vee r = \text{True}

Join operation in lattice theory

a∨b=sup⁡{a,b}a \vee b = \sup\{a,b\} 
a \vee b = \sup\{a,b\}

Set union expressed using logical notation

x∈A∨x∈B  ⟺  x∈(A∪B)x \in A \vee x \in B \iff x \in (A \cup B) 
x \in A \vee x \in B \iff x \in (A \cup B)