Summary and clarification ...
The Boolean algebra is based on the following axioms: 
Operator (·) is called the operator of logical product (AND).
The operator (+) operator is called the logical sum (OR).
The operator (¯) is called a logical operator (NOT).
These axioms must be accepted in Boolean logic and therefore should not be interpreted according to mathematical rules and usual (in this case would be absurd to put 1 + 1 = 1).
circuit interpretation of these axioms can be given through the following illustration:
quest'algebra Exploiting the rules can be expressed in summary form, the logic function of any circuit, through its logical expression . For example the expression:
Operator (·) is called the operator of logical product (AND). The operator (+) operator is called the logical sum (OR).
The operator (¯) is called a logical operator (NOT).
These axioms must be accepted in Boolean logic and therefore should not be interpreted according to mathematical rules and usual (in this case would be absurd to put 1 + 1 = 1).
circuit interpretation of these axioms can be given through the following illustration:
quest'algebra Exploiting the rules can be expressed in summary form, the logic function of any circuit, through its logical expression . For example the expression: 
satisfies the truth table:
0 comments:
Post a Comment