Boolean Algebra Calculator
Calculate boolean algebra operations and verify boolean laws with this comprehensive calculator.
Input Variables
Current Values:
Basic Operations
Boolean Laws Verification
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
Where:
- A, B, C= Boolean variables — each is either 0 (false) or 1 (true)
How to Use
- Set inputs: Enter 1 or 0 (or true/false) for A, B, and C.
- Read results: All operations are computed simultaneously — AND, OR, NOT, NAND, NOR, XOR, XNOR for each variable.
- 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:
- 1A AND B = 1 ∧ 0 = 0
- 2A OR B = 1 ∨ 0 = 1
- 3NOT A = ¬1 = 0
- 4A XOR B = 1 ⊕ 0 = 1
- 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:
- 1Left: !(1 & 1) = !(1) = 0
- 2Right: !1 | !1 = 0 | 0 = 0
- 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
Sources & References
- Boolean Algebra - Wikipedia (2024)
- Logic Gates - Khan Academy (2024)
- De Morgan's Laws - Math is Fun (2024)
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.
Formula Source: Handbook of Mathematical Functions
by Abramowitz & Stegun