Logical conjunction
From The Art and Popular Culture Encyclopedia
|
Related e |
|
Featured: |
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 Template:Math or Template:Math.
"A and B" is true only if A is true and 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.
[edit]
See also
- And-inverter graph
- AND gate
- Binary and
- Bitwise AND
- Boolean algebra (logic)
- Boolean algebra topics
- Boolean conjunctive query
- Boolean domain
- Boolean function
- Boolean-valued function
- Conjunction introduction
- Conjunction elimination
- De Morgan's laws
- First-order logic
- Fréchet inequalities
- Grammatical conjunction
- Logical disjunction
- Logical negation
- Logical graph
- Logical value
- Operation
- Peano–Russell notation
- Propositional calculus
Unless indicated otherwise, the text in this article is either based on Wikipedia article "Logical conjunction" or another language Wikipedia page thereof used under the terms of the GNU Free Documentation License; or on research by Jahsonic and friends. See Art and Popular Culture's copyright notice.
