Browse Source

Delete arch_lect5c_digLogicBoolAgeN (2).pdf

yeungalan 6 năm trước cách đây
mục cha
commit
6ff8c1871c

+ 0 - 73
7-Zip File Manager/tmp/8213/arch_lect5c_digLogicBoolAgeN (2).pdf

@@ -1,73 +0,0 @@
-CA Lecture 5c: Digital Logic
-
-  Properties of Boolean Algebra
-
-  Read Appendix A of textbook: p450 – p456
-
-  (Not examined, except DeMorgan
-  theorem)
-
-                                                                                                                         1
-Properties of Boolean Algebra
-
-                                                                                                                              2
-Properties of Boolean Algebra
-                Cont.
-
-• The postulates are basic axioms of Boolean
-  algebra and therefore need no proofs.
-
-• The theorems can be proven from the
-  postulates.
-
-• Each relationship has both an AND form and
-  an OR form as a result of the principle of
-  duality.
-
-• The dual form is obtained by replacing AND
-  with OR and OR with AND, 1’s with 0’s, and
-  0’s with 1’s.
-
-                                                                                                                               3
-  Properties of Boolean Algebra
-
-                  Cont.
-
-• The commutative property states that the
-  order that two variables appear in an AND or
-  OR function is not significant.
-
-• The distributive property shows how a
-  variable is distributed over an expression.
-
-• The identity property states that a variable
-  that is ANDed with 1 or is ORed with 0
-  produces the original variable.
-
-• The complement property states that a
-  variable that is ANDed with its complement is
-  logically false, and a variable that is ORed
-  with its complement is logical true.
-
-                                                                                                                              4
-Properties of Boolean Algebra
-
-                Cont.
-
-• The zero and one theorems state that a
-  variable that is ANDed with 0 produces a 0,
-  and a variable that is ORed with 1 produces a
-  1.
-
-• The idempotence theorem states that a
-  variable that is ANDed or ORed with itself
-  produces the original variable.
-
-• The associative theorem states that the order
-  of ANDing or ORing is logically of no
-  consequence.
-
-• The involution theorem states that the
-  complement of a complement leaves the
-  original variable (or expression) unchanged. 5
-