switching algebra
Switching algebra is the technical application of Boolean algebra and uses the basic functions of logics: AND gate, OR gate and NOT gate. It can be used to optimize the switching functions and minimize the number of logics.
The operators of these logic functions are represented by special characters. The logic operation of the AND gate is called conjunction, that of the OR gate is called disjunction and that of the NOT gate is called negation.
The result of a conjunction of the two elements "a" and "b" becomes "1" if both elements are "1". (a=1, b=1). The result of a disjunction, separation and probing, formed by the OR function, becomes "1" if one of the two elements "a" or "b" is "1" (a=1 or b=1). In negation, the element is always inverted, a=1 corresponds to a(across)=0, and vice versa.