16.

(Continued)

The truth table on page 1-8 indicates that either switch A or switch B or both can be

closed and the lamp will light. If neither switch is closed, the lamp will not light. This is

known as the OR function, because switch A switch B or both must be closed to produce

an output. The Boolean expression for this condition is A+B (read A or B).

The logic of an OR function is stated: If

condition or

conditions are

,the result is

.

any

17.

The logic of an AND function states:

all

a. If, and only if, all conditions are false, the result will be false.

true

b. If, and only if, all conditions are true, the result will be false.

true

c. If, and only if, all conditions are false, the result will be true.

d. If, and only if, all conditions are true, the result will be true.

d.

18.

The NOT function in Boolean algebra is described as "any circuit which inverts a logic

function." The symbol for the NOT function is a vinculum over the variable. For

example, Ā is read as "NOT A."

Integrated Publishing, Inc. |