Home Identity Domination Associative Commutative Distributive Review

Boolean Sum is denoted by a "+", "v",or by "OR". This is the same as the English 'or' statement. If one "or" the other is true, then it is ok, or true.

If either x or y are true, then the overall solution is true. the only way it could be false is if both are false.

Examples:

Boolean Complement

Boolean Sum

Boolean Product

 

X Y Solution
False True True
True False True
True True True
False False False
X Y Solution
0 1 1
1 0 1
1 1 1
0 0 0
CS 330