Boolean Algebra Calculator

Calculate boolean algebra operations and verify boolean laws with this comprehensive calculator.

Input Variables

Current Values:

A = 1B = 0C = 1

Basic Operations

NOT A:0
NOT B:1
A AND B:0
A OR B:1
A XOR B:1
A NAND B:1
A NOR B:0
A XNOR B:0
A → B (Implies)
0
B → A (Implies)
1
Majority(A,B,C)
1
Parity(A,B,C)
0

Boolean Laws Verification

Commutative (AND):Verified
Commutative (OR):Verified
De Morgan's Law 1:Verified
De Morgan's Law 2:Verified

Boolean Algebra Reference

Basic Operations

  • AND (conjunction): A AND B = A * B
  • OR (disjunction): A OR B = A + B
  • NOT (negation): NOT A = A'
  • XOR (exclusive or): A XOR B

Important Laws

  • De Morgan's: (A*B)' = A' + B'
  • De Morgan's: (A+B)' = A' * B'
  • Distributive: A*(B+C) = A*B + A*C
  • Identity: A*1 = A, A+0 = A

What Is Boolean Algebra?

Boolean algebra is the mathematics of logic, where variables take only two values: 0 (false) and 1 (true). The fundamental operations are AND (&), OR (|), NOT (!), XOR (^). This calculator takes up to three Boolean inputs (A, B, C) and computes all common operations — AND, OR, NOT, NAND, NOR, XOR, XNOR — displaying results in a truth-table format. It's an essential tool for digital logic design, circuit simplification, and programming conditional logic.

Every digital circuit — from a simple light switch to a microprocessor — is built from Boolean algebra. The laws (commutative, associative, distributive, De Morgan's) let you simplify complex expressions before implementing them in hardware or code.

Boolean Operations

Fundamental Boolean Operations

AND: A & B = 1 only if both are 1 OR: A | B = 1 if either is 1 NOT: !A = 1 if A is 0 XOR: A ^ B = 1 if exactly one is 1 De Morgan: !(A&B) = !A | !B

Where:

  • A, B, C= Boolean variables — each is either 0 (false) or 1 (true)

How to Use

  1. Set inputs: Enter 1 or 0 (or true/false) for A, B, and C.
  2. Read results: All operations are computed simultaneously — AND, OR, NOT, NAND, NOR, XOR, XNOR for each variable.
  3. Experiment: Change inputs to see how each operation responds — this builds intuition for logic gates and truth tables.

Applications

Boolean algebra is the foundation of digital electronics. Every logic gate (AND, OR, NOT, NAND, NOR, XOR) in an integrated circuit implements a Boolean operation. In computer programming, conditional statements and bitwise operations directly use Boolean algebra. In database queries, SQL WHERE clauses combine conditions with AND, OR, NOT. In search engines, Boolean operators refine search results.

Worked Examples

Basic Operations

Problem:

Given A=1, B=0, C=1, compute all operations.

Solution Steps:

  1. 1A AND B = 1 ∧ 0 = 0
  2. 2A OR B = 1 ∨ 0 = 1
  3. 3NOT A = ¬1 = 0
  4. 4A XOR B = 1 ⊕ 0 = 1
  5. 5A NAND B = ¬(1 ∧ 0) = 1

Result:

AND=0, OR=1, NOT A=0, XOR=1, NAND=1, NOR=0, XNOR=0.

De Morgan's Law Verification

Problem:

Verify !(A & B) = !A | !B for A=1, B=1.

Solution Steps:

  1. 1Left: !(1 & 1) = !(1) = 0
  2. 2Right: !1 | !1 = 0 | 0 = 0
  3. 3Both equal — De Morgan verified.

Result:

!(1 & 1) = 0 = !1 | !1. De Morgan's law holds.

Tips & Best Practices

  • NAND and NOR are 'universal gates' — any Boolean expression can be built using only NAND or only NOR gates.
  • XOR is true when inputs differ — it's the digital equivalent of 'unequal'.
  • De Morgan's laws let you push negations inward: !(A | B) = !A & !B.
  • The truth table for n variables has 2^n rows — this calculator shows results for your specific inputs.

Frequently Asked Questions

OR returns 1 if either or both inputs are 1. XOR (exclusive OR) returns 1 only if exactly one input is 1 — it's false when both are 1. For inputs (1, 1): OR = 1, XOR = 0. XOR is used in parity checks, cryptography, and arithmetic circuits.
NAND is 'NOT AND' — it outputs the opposite of AND. NOR is 'NOT OR'. Both are called universal gates because any Boolean function can be implemented using only NAND gates (or only NOR gates). In practice, NAND flash memory and CMOS logic rely on this property.
De Morgan's laws state that NOT (A AND B) = NOT A OR NOT B, and NOT (A OR B) = NOT A AND NOT B. They're essential for simplifying negated compound expressions — turning a negation of a conjunction into a disjunction of negations, and vice versa.

Sources & References

Last updated: 2026-06-06

💡

Help us improve!

How would you rate the Boolean Algebra Calculator?

<>

Editorial Note

MyCalcBuddy Editorial Team

This page is maintained as an educational calculator reference.

Source

Formula Source: Handbook of Mathematical Functions

by Abramowitz & Stegun

UpdatedLast reviewed: May 2026
CheckedFormula checks are based on standard references and internal QA review.