Professional Documents
Culture Documents
Closure W.R.T. The Operator + ( ) 2. Associative W.R.T. + ( ) 3. Commutative W.R.T. + ( )
Closure W.R.T. The Operator + ( ) 2. Associative W.R.T. + ( ) 3. Commutative W.R.T. + ( )
Huntington, 1904)
數位邏輯 A set of elements B={0,1} and two binary operators + and ‧
• Huntington postulates
1. Closure w.r.t. the operator + (‧)
x, y ∈ B ⇒ x+y ∈B; x, y ∈ B ⇒ x‧y ∈B
2. Associative w.r.t. + (‧)
(x+y)+z = x + (y + z); (x‧y)‧z = x ‧ (y‧z)
3. Commutative w.r.t. + (‧)
x+y = y+x; x‧y = y‧x
4. An identity element w.r.t. + (‧)
吳俊興 0+x = x+0 = x; 1‧x = x‧1= x
5. ∀ x ∈ B, ∃ x' ∈ B (complement of x)
高雄大學 資訊工程學系 x+x'=1; x‧x'=0
6. ‧ is distributive over + : x‧(y+z)=(x‧y)+(x‧z)
+ is distributive over ‧: x+ (y‧z)=(x+ y)‧(x+ z)
September 2004 Duality principle: remains valid if the operators and identity elements
are interchanged
‧= AND
+ = OR
2-1 Basic Definitions
‘ = NOT
2-2 Axiomatic Definition of Boolean Algebra
2-3 Basic Theorems and Properties
2-4 Boolean Functions Distributive law: x‧(y+z)=(x‧y)+(x‧z)
Theorem 5. DeMorgan
Logic Circuit ⇔ Boolean Function
Boolean Functions
F1 = x + (y’z) F2 = x’y’z + x’yz + xy’
(x+y’+z’)
F(A, B, C) = Σ(1, 4, 5, 6, 7) = Π(0, 2, 3)
F’(A, B, C) = Σ(0, 2, 3) = Π(1, 4, 5, 6, 7)