World Library  
Flag as Inappropriate
Email this Article

Logical conjunction

Article Id: WHEBN0000018152
Reproduction Date:

Title: Logical conjunction  
Author: World Heritage Encyclopedia
Language: English
Subject: Photochemical logic gate, Logical connective, Negation, Truth table, Sheffer stroke
Collection: Logical Connectives
Publisher: World Heritage Encyclopedia

Logical conjunction

Venn diagram of \scriptstyle A \and B
Venn diagram of \scriptstyle A \and B \and C

In logic and mathematics, 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 and B" is true only if A is true and B is true.

An operand of a conjunction is a conjunct.

Related concepts in other fields are:


  • Notation 1
  • Definition 2
    • Truth table 2.1
  • Introduction and elimination rules 3
  • Properties 4
  • Applications in computer engineering 5
  • Set-theoretic correspondence 6
  • Natural language 7
  • See also 8
  • References 9
  • External links 10


And is usually denoted by an infix operator: in mathematics and logic, or × ; in electronics, ; and in programming languages, &, &&, or and. In Jan Łukasiewicz's prefix notation for logic, the operator is K, for Polish koniunkcja.[1]


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.

The conjunctive identity is 1, which is to say that AND-ing an expression with 1 will never change the value of the expression. In keeping with the concept of vacuous truth, when conjunction is defined as an operator or function of arbitrary arity, the empty conjunction (AND-ing over an empty set of operands) is often defined as having the result 1.

Truth table

Conjunctions of the arguments on the left — The true bits form a Sierpinski triangle.

The truth table of ~A \and B:

A B A \and B

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.

Therefore, A and B.

or in logical operator notation:

\vdash A \and B

Here is an example of an argument that fits the form conjunction introduction:

Bob likes apples.
Bob likes oranges.
Therefore, Bob likes apples and oranges.

Conjunction elimination is another classically valid, simple argument form. Intuitively, it permits the inference from any conjunction of either element of that conjunction.

A and B.
Therefore, A.

...or alternately,

A and B.
Therefore, B.

In logical operator notation:

A \and B
\vdash A

...or alternately,

A \and B
\vdash B


commutativity: yes
A \and B     \Leftrightarrow     B \and A
associativity: yes
~A ~~~\and~~~ (B \and C)     \Leftrightarrow     (A \and B) ~~~\and~~~ ~C
~~~\and~~~     \Leftrightarrow         \Leftrightarrow     ~~~\and~~~

with various operations, especially with or

~A \and (B \or C)     \Leftrightarrow     (A \and B) \or (A \and C)
\and     \Leftrightarrow         \Leftrightarrow     \or
idempotency: yes
~A~ ~\and~ ~A~     \Leftrightarrow     A~
~\and~     \Leftrightarrow    
monotonicity: yes
A \rightarrow B     \Rightarrow     (A \and C) \rightarrow (B \and C)
    \Rightarrow         \Leftrightarrow     \rightarrow

truth-preserving: yes

When all inputs are true, the output is true.

A \and B     \Rightarrow     A \and B
(to be tested)

falsehood-preserving: yes

When all inputs are false, the output is false.

A \and B     \Rightarrow     A \or B
(to be tested)

Walsh spectrum: (1,-1,-1,1)

Nonlinearity: 1 (the function is bent)

If using binary values for true (1) and false (0), then logical conjunction works exactly like normal arithmetic multiplication.

Applications in computer engineering

In high-level computer programming and digital electronics, logical conjunction is commonly represented by an infix operator, usually as a keyword such as "AND", an algebraic multiplication, or the ampersand symbol "&". Many languages also provide short-circuit control structures corresponding to logical conjunction.

Logical conjunction is often used for bitwise operations, where 0 corresponds to false and 1 to true:

  • 0 AND 0  =  0,
  • 0 AND 1  =  0,
  • 1 AND 0  =  0,
  • 1 AND 1  =  1.

The operation can also be applied to two binary words viewed as bitstrings of equal length, by taking the bitwise AND of each pair of bits at corresponding positions. For example:

  • 11000110 AND 10100011  =  10000010.

This can be used to select part of a bitstring using a bit mask. For example, 10011101 AND 00001000  =  00001000 extracts the fifth bit of an 8-bit bitstring.

In computer networking, bit masks are used to derive the network address of a subnet within an existing network from a given IP address, by ANDing the IP address and the subnet mask.

Logical conjunction "AND" is also used in SQL operations to form database queries.

The Curry-Howard correspondence relates logical conjunction to product types.

Set-theoretic correspondence

The membership of an element of an intersection set in set theory is defined in terms of a logical conjunction: xAB if and only if (xA) ∧ (xB). Through this correspondence, set-theoretic intersection shares several properties with logical conjunction, such as associativity, commutativity, and idempotence.

Natural language

As with other notions formalized in mathematical logic, the logical conjunction and is related to, but not the same as, the grammatical conjunction and in natural languages.

English "and" has properties not captured by logical conjunction. For example, "and" sometimes implies order. For example, "They got married and had a child" in common discourse means that the marriage came before the child. The word "and" can also imply a partition of a thing into parts, as "The American flag is red, white, and blue." Here it is not meant that the flag is at once red, white, and blue, but rather that it has a part of each color.

See also


  1. ^ 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.

External links

  • Hazewinkel, Michiel, ed. (2001), "Conjunction",  
  • Wolfram MathWorld: Conjunction

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.