What is the difference between SOP and POS?

SOP (Sum of Products) is an OR of AND terms, like AB + CD. POS (Product of Sums) is an AND of OR terms, like (A+B)(C+D). Both are canonical forms used in digital logic design.

What are De Morgan's laws?

De Morgan's laws state: (A+B)' = A'·B' and (A·B)' = A'+B'. They allow you to convert between AND and OR operations by inverting inputs and outputs.

Boolean Algebra Simplifier & Logic Gate Solver

Q: How do you simplify Boolean expressions?

To simplify Boolean expressions: 1) Apply basic laws like Identity (A+0=A) and Complement (A+A'=1), 2) Use De Morgan's theorem to handle negations, 3) Apply absorption and distributive laws. Our calculator automates this with step-by-step explanations.

Q: Can I use this calculator for homework?

Yes! Our calculator is perfect for verifying homework answers. It shows which Boolean laws are applied at each step, helping you learn the methodology. We recommend solving problems manually first, then checking with our tool.

Solve Complex Expressions with Step-by-Step Proofs

Simplify, expand, and verify boolean expressions. Supports XOR, XNOR, and De Morgan’s Laws.

Expression

← Click to insert

A + A'B (A+B)(A+C) A(A+B)

Quick Reference

Identity Law A + 0 = A, A · 1 = A
Domination Law A + 1 = 1, A · 0 = 0
Idempotent Law A + A = A, A · A = A
Complement Law A + A' = 1, A · A' = 0
Commutative Law A + B = B + A, AB = BA

📚 Example Problems

Click any example to load it into the calculator

Identity Law - Adding Zero

A + 0

→ A

Demonstrates the Identity Law: A + 0 = A. Adding zero to any variable does not change its value.

Idempotent Law - OR

A + A

→ A

Demonstrates the Idempotent Law: A + A = A. ORing a variable with itself results in the same variable.

Idempotent Law - AND

A * A

→ A

Demonstrates the Idempotent Law: A · A = A. ANDing a variable with itself results in the same variable.

Domination Law - OR with 1

A + 1

→ 1

Demonstrates the Domination Law: A + 1 = 1. ORing any variable with 1 always results in 1.

Domination Law - AND with 0

A * 0

Demonstrates the Domination Law: A · 0 = 0. ANDing any variable with 0 always results in 0.

Complement Law - OR

A + A'

→ 1

Demonstrates the Complement Law: A + A' = 1. A variable ORed with its complement is always 1.

Complement Law - AND

A * A'

Demonstrates the Complement Law: A · A' = 0. A variable ANDed with its complement is always 0.

Simple Absorption

A + AB

→ A

Demonstrates the Absorption Law: A + AB = A. The term AB is absorbed by A.

Simple Distributive

A(B + C)

→ AB + AC

Demonstrates the Distributive Law: A(B+C) = AB + AC. Multiply A across the parenthesis.

Double Negation

(A')'

→ A

Demonstrates Double Complement: (A')'= A. Inverting twice returns the original.

Classic Simplification

(A + B)(A + C)

→ A + BC

Classic problem combining Distributive, Idempotent, and Absorption laws.

Three-Term Absorption

A + A'B

→ A + B

Demonstrates modified Absorption: A + A'B = A + B.

De Morgan's Law - OR

(A + B)'

→ A'B'

Demonstrates De Morgan's Law: (A+B)' = A'·B'. The complement of a sum is the product of complements.

De Morgan's Law - AND

(AB)'

→ A' + B'

Demonstrates De Morgan's Law: (AB)' = A' + B'. The complement of a product is the sum of complements.

Complex Absorption

AB + A'C + BC

→ AB + A'C

Demonstrates the Consensus Theorem: AB + A'C + BC = AB + A'C. The BC term is redundant.

Four Variable Simplification

AB + AB'C + AB'C'

→ AB + AB'

Multi-step simplification using Distributive and Identity laws.

XOR Implementation

AB' + A'B

→ AB' + A'B

This is the XOR function A ⊕ B. It is already in simplified form.

Majority Function

AB + BC + AC

→ AB + BC + AC

Majority function for 3 variables. Output is 1 when at least 2 inputs are 1. Already optimal.

Distributive with Absorption

(A + B)(A + B')

→ A

Combines Distributive Law with Complement and Identity laws.

Complex OR Simplification

A + A'B + A'B'C

→ A + B + C

Multi-step problem showing progressive absorption.

Redundant Term Elimination

ABC + ABC' + AB'C

→ AB + AC

Uses Distributive law to factor and eliminate redundant terms.

NAND Gate Conversion

(AB)'(CD)'

→ (AB)' + (CD)'

Shows De Morgan's conversion of NAND operations.

SOP to Minimal

A'B'C + A'BC + ABC

→ A'C + BC

Sum of Products minimization using K-Map logic.

Mixed Operations

(A + B')(A' + B)

→ A'B' + AB

Expansion using Distributive law, results in XNOR function.

Triple Term Expansion

(A + B + C)(A + B + C')

→ A + B

Three-variable expansion with complement cancellation.

Four Variable Consensus

AB'C + A'BC + ABC' + ABC

→ AB + BC + AC

Complex 4-variable expression requiring multiple law applications.

Full Adder Sum

A'B'C + A'BC' + AB'C' + ABC

→ A⊕B⊕C

Full adder sum output. Equals A XOR B XOR C.

Full Adder Carry

AB + BC + AC

→ AB + BC + AC

Full adder carry output. Already in optimal form (majority function).

Complex De Morgan

((A + B)(C + D))'

→ (A' + C')(A' + D')(B' + C')(B' + D')

Multiple applications of De Morgan's law.

Multiplexer 2-to-1

A'B'S + ABS'

→ A'B'S + ABS'

2-to-1 multiplexer function. Already optimally minimized.

Seven Segment Decoder

A'B'C'D + A'BCD' + AB'C'D'

→ A'B'C + A'BD + AB'C'D'

BCD to 7-segment decoder segment A logic.

Parity Generator

A'B'C'D + A'B'CD' + A'BC'D' + A'BCD + AB'C'D' + AB'CD + ABC'D + ABCD'

→ A⊕B⊕C⊕D

4-bit odd parity generator. Equals A XOR B XOR C XOR D.

Gray to Binary

G0 + G1'G2'G3

→ G0 + G1'G2'G3

Gray code to binary conversion logic for LSB.

Complex Factoring

A'B'C'D + A'B'CD + A'BC'D + A'BCD + AB'C'D + AB'CD

→ A'B' + A'D + AB'D

Requires K-Map or Quine-McCluskey for optimal minimization.

BCD to Excess-3

A'B'C + A'BC' + AB'C'

→ A'B'C + A'BC' + AB'C'

BCD to Excess-3 code converter logic. Already minimal.

How to Use the Boolean Algebra Calculator

Enter Your Expression

Type your Boolean expression using variables (A, B, C...) and operators (+, *, ', parentheses). Example: (A+B)(A+C)

Click Simplify

Our calculator uses the Quine-McCluskey algorithm combined with algebraic laws to find the optimal simplified form.

Review Results

See the simplified expression, step-by-step laws applied, truth table, and K-Map visualization.

Study the Steps

Learn which Boolean laws were applied at each step. Perfect for homework verification!

Export Your Work

Download as LaTeX for academic papers, save as text file, or print as PDF.

Try Examples

Scroll down to see 35+ worked examples from beginner to advanced difficulty.

Common Mistakes to Avoid

❌ Incorrect: Using × or · inconsistently

Don't mix multiplication symbols. Our calculator accepts AB, A*B, or A·B.

✅ Correct: Stick to one format throughout

❌ Incorrect: Forgetting parentheses

A+BC is very different from A+B*C or (A+B)C

✅ Correct: Always use parentheses for clarity

❌ Incorrect: Confusing ' with negation

Use A' for NOT A, not !A or ~A

✅ Correct: Use apostrophe (') for complement

❌ Incorrect: Ignoring operator precedence

AND (·) has higher precedence than OR (+), just like × and + in math

✅ Correct: A+BC means A+(B·C)

❌ Incorrect: Misapplying De Morgan's Law

(A+B)' ≠ A'+B'

✅ Correct: (A+B)' = A'·B'

❌ Incorrect: Stopping simplification too early

Always check if absorption or consensus laws can simplify further

✅ Correct: Use our calculator to verify you've reached the minimal form

Pro Tips for Boolean Simplification

💡

Start with Distribution

Apply Distributive Law first to expand expressions, then look for absorption patterns.

🎯

Look for Complements

Terms like A+A' or A·A' can immediately simplify to 1 or 0.

📊

Use the K-Map

For 2-4 variables, visually identify groups in the K-Map for faster simplification.

🔄

Try Different Forms

Convert between SOP (Sum of Products) and POS (Product of Sums) to find the minimal form.

✅

Verify with Truth Tables

Original and simplified expressions must have identical truth tables.

📚

Practice with Examples

Work through our 35+ examples to master pattern recognition.

Frequently Asked Questions

How do you simplify Boolean expressions?

Our tool uses the Quine-McCluskey algorithm and Boolean laws like De Morgan’s and the Consensus Theorem to find the absolute minimal form.

Does this tool support XOR?

Yes! Our advanced parser expands XOR ($A \oplus B$) into its SOP form ($A'B + AB'$) before simplification.

Can I see the logic circuit?

Yes, every result includes a generated SVG logic gate diagram.

What is Boolean algebra simplification?

Boolean algebra simplification is the process of reducing a Boolean expression to its minimal form using Boolean laws (Identity, Domination, Idempotent, Complement, Absorption, Distributive, and De Morgan's laws). A simplified expression uses fewer gates in digital circuits and is easier to understand.

How does the Quine-McCluskey algorithm work?

The Quine-McCluskey algorithm is a tabular method for Boolean function minimization. It systematically finds all prime implicants, identifies essential prime implicants, and selects the minimum set needed to cover all minterms. Our calculator uses this for optimal results on complex expressions.

What's the difference between SOP and POS?

SOP (Sum of Products) is an OR of ANDs: AB + A'C + BC. POS (Product of Sums) is an AND of ORs: (A+B)(A'+C)(B+C). Our calculator shows the most compact form.

Can I use this calculator for homework?

Yes! Our calculator is perfect for verifying your homework answers and understanding the step-by-step simplification process. We show which Boolean laws are applied at each step, helping you learn the methodology. However, we recommend solving problems manually first, then using our tool to check your work.

How many variables can the calculator handle?

Our calculator supports 2-4 variables efficiently with full K-Map visualization. For expressions with 5+ variables, we use the Quine-McCluskey algorithm which can handle larger expressions, though K-Map visualization is limited to 4 variables.

What is a K-Map and how do I read it?

A Karnaugh Map (K-Map) is a visual method for simplifying Boolean expressions. Cells with value '1' (minterms) are grouped in powers of 2 (groups of 1, 2, 4, 8...). Each group represents a product term in the simplified expression. Our calculator shows these groups and explains which minterms they cover.

Why does my simplified expression look different from the book?

There can be multiple equivalent "minimal" forms, especially when using different forms (SOP vs POS) or factoring differently. If the truth tables match, both answers are correct. Our calculator provides the most algorithmically optimal form using Quine-McCluskey.

Can I export my results for reports?

Absolutely! Use our export buttons to:
• Copy LaTeX - Perfect for academic papers and reports
• Download Text - Save as .txt file for later reference
• Print PDF - Create a PDF for submission or archiving

What operators can I use in expressions?

AND: Use AB, A*B, or A·B
OR: Use A+B
NOT: Use A' for complement
Parentheses: (A+B) for grouping

Is the calculator free to use?

Yes! Our Boolean Algebra Calculator is completely free with no registration required. We provide unlimited simplifications, truth tables, K-Maps, and exports. Use it for homework, exam preparation, or professional circuit design work.