Home Identity Domination Associative Commutative Distributive Review

Boolean Complement

Boolean Sum

Boolean Product

Identity Laws: These laws simply show cases where if you place a binary number {0,1} into the formula, then the solution will be that same binary number that was used as the input.

 

In equation 1, if you OR any number x with 0 then your solution will be the number x because for the solution to be 1;one of the two numbers have to be equal to 1. Since the second part of the OR operation is already zero, the number x has to be 1 for the solution to be one.

In equation 2, when you use the AND operation the solution is equal to 1 only if both numbers are 1. Since the second number is already 1 then the first one has to be one in order to equal 1.

Examples:

X  VY Solution
0 0 0
1 0 1
X  ^Y Solution
0 1 0
1 1 1

1) x V 0 = x

2) x ^ 1 = x

CS 330