AND (Logical AND) Calculator

Perform boolean AND operations, view complete truth tables for all logic gates, and compute bitwise AND for integers.

Logical AND Calculator

Result

A AND B
False (0)

AND Truth Table

All Logic Gate Truth Tables

True AND False = False

Boolean Algebra and Logic Gates

Boolean algebra is a branch of mathematics that deals with operations on logical values. It was introduced by George Boole in the mid-19th century and forms the foundation of digital circuit design, computer science, and programming. Boolean variables can only take two values: True (1) or False (0).

The AND Operation

The AND operation (also written as conjunction, denoted by the symbols &&, *, or the dot operator) outputs True only when all inputs are True. If any input is False, the output is False. In everyday language, "I will go if it is sunny AND warm" means both conditions must be met.

Truth Tables for All Logic Gates

AND Gate

Output is True only when both inputs are True.

A AND B = A * B

OR Gate

Output is True when at least one input is True.

A OR B = A + B

NOT Gate

Inverts the input: True becomes False and vice versa.

NOT A = !A

NAND Gate

Output is False only when both inputs are True (NOT AND).

A NAND B = !(A * B)

NOR Gate

Output is True only when both inputs are False (NOT OR).

A NOR B = !(A + B)

XOR Gate

Output is True when inputs are different (exclusive OR).

A XOR B = A ^ B

Applications in Programming

In programming, boolean logic is used extensively in conditional statements (if/else), loop conditions (while/for), and bitwise operations. The AND operator (&& in most languages) short-circuits: if the first operand is False, the second is not evaluated since the result must be False regardless. This is used for guard clauses and null-checking: if (obj != null && obj.value > 0).

Bitwise AND

Bitwise AND operates on individual bits of integer values. Each bit of the result is 1 only if the corresponding bits of both operands are 1. For example: 12 AND 10 = 8, because in binary: 1100 AND 1010 = 1000. Bitwise AND is commonly used for:

  • Masking: Extracting specific bits from a number (e.g., value & 0xFF to get the lowest byte).
  • Flag checking: Testing if specific flags are set in a bit field.
  • Alignment: Aligning addresses or sizes to power-of-two boundaries.

Digital Circuit Applications

In digital electronics, AND gates are fundamental building blocks. Together with OR and NOT gates, they can implement any boolean function. AND gates are used in address decoders, multiplexers, and arithmetic circuits. The NAND gate is particularly important because it is a "universal gate": any boolean function can be implemented using only NAND gates.

De Morgan's Laws

De Morgan's laws describe important relationships between AND, OR, and NOT operations:

  • First Law: NOT (A AND B) = (NOT A) OR (NOT B)
  • Second Law: NOT (A OR B) = (NOT A) AND (NOT B)

These laws are fundamental for simplifying boolean expressions and are used extensively in circuit optimization and programming.