Scribd
Upload
54 views3 pages

Movation Circuit

- Boolean algebra provides an algebraic framework for modeling logical operations using sets and propositions. It defines basic operations like intersection, union, and complement that behave similarly to logical AND, OR, and NOT. - The algebra of sets and algebra of propositions both satisfy the same properties of a Boolean algebra, with operations mapping directly between the two. - Boolean algebra can be used to simplify and analyze digital circuits built from logic gates like AND, OR, and NOT.

Uploaded by

karan007_m
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views3 pages

Movation Circuit

- Boolean algebra provides an algebraic framework for modeling logical operations using sets and propositions. It defines basic operations like intersection, union, and complement that behave similarly to logical AND, OR, and NOT. - The algebra of sets and algebra of propositions both satisfy the same properties of a Boolean algebra, with operations mapping directly between the two. - Boolean algebra can be used to simplify and analyze digital circuits built from logic gates like AND, OR, and NOT.

Uploaded by

karan007_m
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Section 10.

2 Boolean Algebra
Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra
of propositional wffs.
·Propositional Wffs; false, true, ⁄, Ÿ, ¬Ò ·power(S); ∅, S, », «, ' Ò
Properties: Properties:
A⁄B≡B⁄A A»B=B»A
A ⁄ false ≡ A A»∅=A
(A ⁄ B) ⁄ C ≡ A ⁄ (B ⁄ C) (A » B) » C = A » (B » C)
AŸB≡BŸA A«B=B«A
A Ÿ true ≡ A A«S=A
(A Ÿ B) Ÿ C ≡ A Ÿ (B Ÿ C) (A « B) « C = A « (B « C)
A Ÿ (B ⁄ C) ≡ (A Ÿ B) ⁄ (A Ÿ C) A « (B » C) = (A « B) » (A « C)
A ⁄ (B Ÿ C) ≡ (A ⁄ B) Ÿ (A ⁄ C) A » (B « C) = (A » B) « (A » C)
A Ÿ ¬ A ≡ false A«A'=∅
A ⁄ ¬ A ≡ true. A » A ' = S.

These two algebras are concrete examples of a Boolean algebra · B; 0, 1, +, ⋅, Ò,


which has the following properties:
1. + and · are commutative and associative with identity elements 0 and 1, respectively.
2. + and · distribute over each other. †
3. x + x = 1 and x ⋅ x = 0. 1
Properties of Boolean algebra operations. For any property of the operations there is a
dual property obtained by interchanging 0 with 1, and + with ·. Similarly, any proof has a
dual proof obtained in the same way. Here are some basic properties of the operations.
1. xx = x and x + x = x. Proof: x = x1 = x(x + x ) = xx + xx = xx + 0 = xx.
2. 0 x = 0 and 1 + x = 1. Proof: 0 x = ( x x ) x = x ( xx ) = x x = 0.
3. x + xy = x and x(x + y) = x. Proof: x + xy = x1 + xy = x(1 + y) = x1 = x.
†
† 4. x + x y = x + y and x(x + y) = xy. Proof: x + x y = (x + x )(x + y) = 1(x +y) = x + y.
† 5. If x + y = 1 and xy = 0, then y = x.
Proof: y = y1 = y(x + x ) = yx + yx = 0 + yx = xx + yx = (y + x)x = 1x = x.
†
6. x = x. Proof: x + x = 1 and x x = 0. So x = x.
†
7. x + y = x y and xy = x + y.
† Proof: Show ( x + y ) + x y = 1 and ( x + y) x y = 0. Then use 5 to obtain result.

Quiz (2 minutes). Simplify the expression x + yz + x y + yxz.


†
Answer. x + yz + xy + yxz = (x + xyz) + yz + xy (commute and associate)
= x + yz + xy (absorption)
= (x +†xy) + yz (commute and associate)
= (x + y) + yz (absorption)
= x + ( y + yz) = x + y. (associate and absorption) 2
Digital Circuits
A digital circuit (or logic circuit) is an electronic representation of a truth function. The
following three logic gates can be used to implement any digital circuit.

x x
xy x+y x x
y y
AND gate OR gate NOT gate
†(inverter)
Quiz. Simplify the following digital circuit.

x
y

Solution. The circuit represents the following wff.


( x + y)( x + y )( x + y) = [( x + y)x + ( x + y) y]( x + y) (distribute)
= ( x + xy )( x + y) (absorption, absorption)
= x( x + y) (absorption)
= xy. (absorption)

So the circuit can be implemented by a single AND gate. 3

You might also like