In logic, mathematics and linguistics, And (∧) is the truth-functional operator of logical conjunction; the and of a set of operands is true if and only if all of its operands are true. The logical connective that represents this operator is typically written as ∧ or ⋅ .
A
∧
B
{\displaystyle A\land B}
is true if and only if
A
{\displaystyle A}
is true and
B
{\displaystyle B}
is true.
An operand of a conjunction is a conjunct.
The term "logical conjunction" is also used for the greatest lower bound in lattice theory.
Related concepts in other fields are:
In natural language, the coordinating conjunction "and".
In programming languages, the short-circuit and control structure.
In set theory, intersection.
In predicate logic, universal quantification.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.