Boolean Algebra Calculator

Evaluate logical expressions, generate truth tables, and simplify Boolean expressions

Boolean Expression

Logical Operations:

∧: AND

∨: OR

¬: NOT

⊕: XOR

→: IMPLIES

↔: IFF

⊼: NAND

⊽: NOR

Quick Examples:

Boolean Algebra Laws

Identity Laws

A ∧ 1 = A
A ∨ 0 = A

Domination Laws

A ∧ 0 = 0
A ∨ 1 = 1

Idempotent Laws

A ∧ A = A
A ∨ A = A

Complement Laws

A ∧ ¬A = 0
A ∨ ¬A = 1

Commutative Laws

A ∧ B = B ∧ A
A ∨ B = B ∨ A

Associative Laws

(A ∧ B) ∧ C = A ∧ (B ∧ C)
(A ∨ B) ∨ C = A ∨ (B ∨ C)

Distributive Laws

A ∧ (B ∨ C) = (A ∧ B) ∨ (A ∧ C)
A ∨ (B ∧ C) = (A ∨ B) ∧ (A ∨ C)

De Morgan Laws

¬(A ∧ B) = ¬A ∨ ¬B
¬(A ∨ B) = ¬A ∧ ¬B

Absorption Laws

A ∧ (A ∨ B) = A
A ∨ (A ∧ B) = A

Understanding Boolean Algebra: The Mathematics of Logic

Boolean algebra is a fundamental mathematical system that deals with binary variables and logical operations. Developed by George Boole in the 19th century, it forms the theoretical foundation for digital circuit design, computer programming, and logical reasoning. Unlike conventional algebra that works with numbers, Boolean algebra operates on truth values: TRUE (1) and FALSE (0).

Basic Logical Operations

Boolean algebra is built upon a set of fundamental operations that manipulate truth values:

AND (Conjunction, ∧): Output is TRUE only if all inputs are TRUE. Represents logical conjunction.
OR (Disjunction, ∨): Output is TRUE if at least one input is TRUE. Represents logical disjunction.
NOT (Negation, ¬): Output is the opposite of the input. Represents logical negation.
XOR (Exclusive OR, ⊕): Output is TRUE if inputs are different. Represents exclusive disjunction.
NAND (Not AND): Output is FALSE only if all inputs are TRUE. The negation of AND.
NOR (Not OR): Output is TRUE only if all inputs are FALSE. The negation of OR.

Truth Tables and Logical Analysis

Truth tables provide a systematic way to analyze logical expressions:

Complete enumeration: Lists all possible input combinations
Systematic analysis: Shows output for every input scenario
Expression verification: Validates logical equivalences
Circuit design: Guides digital circuit implementation

Applications in Computer Science

Boolean algebra is essential in numerous computing applications:

Digital Circuit Design: Logic gates implement Boolean operations
Programming: Conditional statements and logical operators
Database Queries: SQL WHERE clauses use Boolean logic
Search Algorithms: Boolean retrieval in information systems
Artificial Intelligence: Knowledge representation and reasoning
Computer Graphics: Boolean operations on geometric shapes

Karnaugh Maps and Simplification

Boolean expression simplification is crucial for efficient circuit design:

Karnaugh Maps: Visual method for simplifying Boolean expressions
Quine-McCluskey Algorithm: Systematic simplification method
Reduced Gates: Simplified expressions require fewer logic gates
Lower Power Consumption: Efficient circuits consume less power
Faster Operation: Simplified logic paths operate more quickly

Logical Equivalences and Proofs

Boolean algebra enables formal logical reasoning:

Logical Equivalence: Two expressions that always have the same truth value
Tautology: An expression that is always TRUE
Contradiction: An expression that is always FALSE
Contingency: An expression that is neither tautology nor contradiction
Logical Proofs: Using Boolean laws to prove equivalences

Advanced Boolean Concepts

Beyond basic operations, Boolean algebra includes advanced topics:

Boolean Functions: Functions that return Boolean values
Canonical Forms: Sum of Products (SOP) and Product of Sums (POS)
Functional Completeness: Sets of operations that can express all Boolean functions
Boolean Rings: Algebraic structure with AND as multiplication and XOR as addition
Switching Theory: Application of Boolean algebra to switching circuits

Boolean algebra is a branch of algebra that deals with binary variables and logical operations. It was developed by George Boole and is fundamental to digital circuit design and computer science.

The basic operations are: AND (conjunction, ∧), OR (disjunction, ∨), NOT (negation, ¬), XOR (exclusive OR, ⊕), NAND (NOT AND), and NOR (NOT OR).

A truth table is a mathematical table that shows all possible combinations of inputs for a logical expression and their corresponding outputs. It systematically lists the truth value of an expression for every possible combination of input values.

De Morgan's Laws are two important transformation rules: ¬(A ∧ B) = ¬A ∨ ¬B and ¬(A ∨ B) = ¬A ∧ ¬B. These laws show how to distribute negation over AND and OR operations.