Result
Disjunctive Normal Form
Simplified Form
Solution Steps
Truth Table
Calculator Input
Supported Operators
| Operator | Meaning | Accepted Forms |
|---|---|---|
| NOT | Negation | !, ~, ¬, NOT |
| AND | Conjunction | &, &&, ∧, AND |
| OR | Disjunction | |, ||, ∨, OR |
| XOR | Exclusive or | ^, ⊕, XOR |
| IMPLIES | Conditional | ->, =>, → |
| IFF | Equivalence | <->, ↔, IFF |
Example Data Table
| Expression | Variables | Canonical DNF | Use Case |
|---|---|---|---|
A & B |
A, B | A ∧ B |
Both rules must pass. |
A | B |
A, B | (¬A ∧ B) ∨ (A ∧ ¬B) ∨ (A ∧ B) |
At least one rule passes. |
A -> B |
A, B | (¬A ∧ ¬B) ∨ (¬A ∧ B) ∨ (A ∧ B) |
Conditional reasoning. |
A ^ B |
A, B | (¬A ∧ B) ∨ (A ∧ ¬B) |
Exactly one rule passes. |
Formula Used
Disjunctive normal form is created by joining all true minterms with OR. Each minterm is created by joining literals with AND.
DNF(F) = OR over all rows where F = True: (literal1 ∧ literal2 ∧ ... ∧ literaln) If a variable is True, use X. If a variable is False, use ¬X.
Example: if A is true, B is false, and C is true, the minterm is
A ∧ ¬B ∧ C.
How to Use This Calculator
- Enter a logical expression in the input field.
- Use parentheses when mixing several operators.
- Add a variable order if you need textbook minterm numbering.
- Select the truth symbol style and output mode.
- Press the calculate button.
- Review the DNF, simplified form, steps, and truth table.
- Export the answer as CSV or PDF when needed.
Disjunctive Normal Form Guide
Introduction
A disjunctive normal form expression writes logic as an OR of AND groups. Each group describes one true case. This style is useful because it turns a complex statement into visible truth patterns.
Why DNF Matters
DNF is common in logic, switching theory, database filters, and rule engines. It helps you see exactly which combinations make a statement true. A truth table can contain many rows, but DNF highlights only the successful rows. This makes testing easier. It also makes explanations easier for learners.
How the Calculator Works
The calculator reads your formula and finds every variable. Then it evaluates all possible true and false combinations. Each row that returns true becomes a minterm. A minterm contains every variable once. True variables stay positive. False variables become negated. Finally, all minterms are joined with OR. That complete expression is the canonical DNF.
Advanced Options
The simplified option reduces repeated patterns where possible. It compares true cases and merges terms that differ by one variable. The ignored variable becomes a don't care position. This can turn long canonical forms into shorter expressions. Simplification is helpful when the formula has many true rows.
Reading the Result
The truth table shows how the expression behaves for each assignment. Minterm numbers show the binary position of each true row. The canonical result is exact and easy to audit. The simplified result is shorter and easier to reuse. When an expression is always false, the DNF is zero. When it is always true, the DNF is one.
Best Practices
Use short variable names when exploring large formulas. Add parentheses when mixing implication, equivalence, XOR, AND, and OR. This removes ambiguity and improves readability. Check the variable order when comparing minterm numbers with textbooks. Export the CSV file for spreadsheets. Export the PDF file for reports or homework notes.
DNF does not change the meaning of your formula. It only changes the shape. That makes it a strong tool for checking, teaching, and documenting logical conditions.
Use the examples below to compare common patterns. Try implication, equivalence, and XOR first. Then edit variables to test your own reasoning clearly without manual work.
FAQs
What is disjunctive normal form?
Disjunctive normal form writes a logical statement as OR groups of AND terms. Each AND group represents one true row from the truth table.
What is a minterm?
A minterm is one AND group containing every variable once. It uses the variable when true and the negated variable when false.
Can this calculator simplify DNF?
Yes. It can create canonical DNF and a reduced form. The simplified result merges compatible true cases to remove repeated literals.
Which operators can I use?
You can use NOT, AND, OR, XOR, implication, and equivalence. Symbols such as !, &, |, ^, ->, and <-> are accepted.
Why should I enter variable order?
Variable order controls truth table columns and minterm numbering. Use it when your class, book, or report expects a fixed order.
What happens if the formula is always false?
If no truth table row is true, the expression is a contradiction. Its disjunctive normal form is shown as zero.
What happens if the formula is always true?
If every truth table row is true, the expression is a tautology. The calculator shows one as the final normal form.
Can I export my result?
Yes. Use the CSV button for spreadsheet data. Use the PDF button for a readable report with expression, result, and table.