What is the difference between AND and OR?

AND requires all conditions to be true for the result to be true. OR requires at least one condition to be true for the result to be true.

What are De Morgan's Laws?

De Morgan's Laws are two rules that explain how to distribute a NOT operator across AND/OR operators. They are: NOT (A AND B) = (NOT A) OR (NOT B), and NOT (A OR B) = (NOT A) AND (NOT B).

Can I use truth tables to simplify expressions?

Yes! A truth table lists out all possible combinations of true/false for your variables. If two expressions have the exact same final column in a truth table, they are equivalent. However, for expressions with many variables, truth tables get very large, so Boolean algebra is usually faster.

What is a Boolean expression and how do you simplify one?

A Boolean expression is a logical statement that can only be evaluated as either true or false. Think of it like a strict bouncer at a club: you either have your ID and are over 18 (true, you get in), or you don't (false, you stay out). There is no maybe.

In computer science, these expressions form the foundation of decision-making in code, like 'if' statements, and the physical logic gates inside computer chips. Simplifying them means rewriting the expression so it uses fewer operations but produces the exact same true or false result, saving both computing time and hardware costs.

What makes up a Boolean expression?

Boolean expressions are built using variables (usually represented by letters like $A$ , $B$ , or $X$ ) and logical operators. The three most common operators are AND (often written as $\cdot$ or $\wedge$ ), OR (written as $+$ or $\vee$ ), and NOT (written as $eg$ , a prime $A'$ , or a bar $\overline{A}$ ). For example, an expression like $A \cdot B$ means both $A$ and $B$ must be true for the whole expression to be true. It is just like ordering a meal: if you ask for a burger AND fries, you will be disappointed if you only get one of them.

Why do we simplify them?

Imagine writing a program that checks if a user is allowed to log in. You could write a long, confusing rule that checks a dozen different overlapping conditions. This long expression takes more time for the computer to process and is harder for other programmers to read. In hardware design, every AND or OR operation requires a physical piece of silicon called a logic gate. By simplifying a Boolean expression, engineers can build the same circuit using fewer gates, which makes the computer chip smaller, cheaper, and faster.

How to simplify using Boolean Algebra

Just like regular algebra, Boolean algebra has rules you can use to combine or cancel out terms. Some rules are obvious: $A + 0 = A$ (anything OR false is just itself) and $A \cdot 1 = A$ (anything AND true is itself). Other rules are unique to logic, like the Idempotent Law: $A + A = A$ . You cannot have "two" true statements; true OR true is still just true. You simplify expressions by looking for common terms, factoring them out, and applying these rules step-by-step until the expression is as short as possible.

Where students slip up

The most common mistake students make is treating Boolean OR (the $+$ symbol) exactly like regular addition. In regular math, $1 + 1 = 2$ . In Boolean algebra, $1 + 1 = 1$ (true OR true is true). Another frequent trap is forgetting to apply NOT operators to everything inside a parenthesis. De Morgan's Laws state that $eg(A + B)$ is actually $eg A \cdot eg B$ , not $eg A + eg B$ . You have to flip the operator when distributing a NOT.

Worked through

Simplify the Boolean expression $A \cdot (A + B)$ .

First, we distribute the $A$ into the parentheses, just like regular algebra: $A \cdot A + A \cdot B$ . Next, we use the Idempotent Law on the first term ( $A \cdot A = A$ ). Now our expression is $A + A \cdot B$ . We can factor out the $A$ , giving us $A \cdot (1 + B)$ . The Annulment Law tells us that anything OR true is true, so $(1 + B)$ becomes $1$ . Our expression is now $A \cdot 1$ . Finally, the Identity Law tells us that $A \cdot 1 = A$ . So, the entire expression simplifies to just $A$ .

Questions students ask

Ask about this topic

Explain at

Where this comes from: Digital Design by M. Morris Mano · Khan Academy: Computers and the Internet unit · OpenStax Introductory Statistics (Probability and Logic)