
related topics 
{math, number, function} 
{theory, work, human} 
{language, word, form} 
{god, call, give} 
{style, bgcolor, rowspan} 
{system, computer, user} 
{black, white, people} 
{island, water, area} 
{government, party, election} 
{woman, child, man} 
{water, park, boat} 

In logic and mathematics, logical conjunction, or: and is a twoplace logical connective that has the value true if both of its operands are true, otherwise a value of false.
The analogue of conjunction for a (possibly infinite) family of statements is universal quantification, which is part of predicate logic.
Contents
Notation
And is usually expressed with an infix operator. In mathematics and logic, it is usually ∧; in electronics ; and in programming languages, & or and. Some programming languages have a related control structure, the shortcircuit and, written &&, and then, etc.
Definition
Logical conjunction is an operation on two logical values, typically the values of two propositions, that produces a value of true if and only if both of its operands are true.
Truth table
The truth table of :
Introduction and elimination rules
As a rule of inference, conjunction introduction is a classically valid, simple argument form. The argument form has two premises, A and B. Intuitively, it permits the inference of their conjunction.
or in logical operator notation:
Here is an example of an argument that fits the form conjunction introduction:
Conjunction elimination is another classically valid, simple argument form. Intuitively, it permits the inference from any conjunction of either element of that conjunction.
...or alternately,
In logical operator notation:
Full article ▸


related documents 
Existential quantification 
Jules Richard 
Cox's theorem 
Outer product 
Pigeonhole principle 
Riemann mapping theorem 
Prim's algorithm 
Paracompact space 
Fixed point combinator 
Base (topology) 
Commutator subgroup 
Generalized mean 
Definable real number 
2 (number) 
Trie 
ML (programming language) 
Augmented Backus–Naur Form 
Boolean ring 
MerkleHellman 
Compactification (mathematics) 
Recursive descent parser 
Poisson process 
Open set 
Chain rule 
Preorder 
Depthfirst search 
Presburger arithmetic 
Monster group 
Delegation pattern 
Gram–Schmidt process 
