Boolean Algebra
Analyze boolean expressions with truth table generation, expression simplification, and canonical form conversion.
Boolean Algebra
Logic expressions
Quick operators:
Operators: AND, OR, NOT, XOR, NAND, NOR. Variables: A-Z, a-z
Quick Examples
Common Examples
A AND B
AND gate
A OR B
OR gate
NOT A
NOT gate
A XOR B
XOR gate
Features
Expression Parsing
Parse and validate boolean expressions with multiple operators
Truth Table Generation
Generate complete truth tables for any boolean expression
Expression Simplification
Simplify expressions using boolean algebra rules
Canonical Forms
Convert to Sum of Products (SOP) canonical form
Multiple Operators
Support for AND, OR, NOT, XOR, NAND, NOR operations
Real-time Analysis
Instant analysis as you type with validation
Usage Tips
•Use uppercase letters (A-Z) for variables
•Supported operators: AND, OR, NOT, XOR, NAND, NOR
•Use parentheses to control operator precedence
•View truth table to understand expression behavior
•Check simplified form for optimized expression
•Use canonical SOP form for standard representation
Boolean Algebra Reference
Basic Operators
ANDLogical AND (both inputs true)
ORLogical OR (at least one input true)
NOTLogical NOT (inverts input)
XORExclusive OR (inputs different)
Boolean Laws
Identity: A AND 1 = A, A OR 0 = A
Domination: A AND 0 = 0, A OR 1 = 1
Idempotent: A AND A = A, A OR A = A
Double Negation: NOT(NOT A) = A
De Morgan: NOT(A AND B) = NOT A OR NOT B