Logic Elements

Switch, Gate, Boolean Algebra

Sukree Sinthupinyo
Department of Computer Science

Thammasat University

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 1/44

Switches
● Electric Circuit
● Electric Circuit
● Physical Switches: Relay
● Physical Switches: Transistor

Logic Gates

Gate-Level Circuits Switches

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 2/44

 Electric Circuit

Switches
● Electric Circuit
■ Most familiar example of a switch: device that controls the
● Electric Circuit
● Physical Switches: Relay
flow of current through an electric circuit
● Physical Switches: Transistor
■ A light fixture L is to be connected to the electric power
Logic Gates
supply P S and to a manual switch S2
Gate-Level Circuits ◆ Turning S2 on and off turns the light on and off
Boolean Algebra
■ A circuit breaker S1 is to be installed near the entry point of
the power supply.
◆ Turning S1 off will turn L off, independently of S2

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 3/44

 Electric Circuit

Switches
● Electric Circuit
● Electric Circuit
● Physical Switches: Relay
● Physical Switches: Transistor

Logic Gates

Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 4/44

 Physical Switches: Relay

Switches
● Electric Circuit
■ Electromechanical Relay contains an electromagnet that
● Electric Circuit
● Physical Switches: Relay
consists of a wire coil wrapped around a magnetizable iron
● Physical Switches: Transistor core
Logic Gates ■ Input variable x of the relay is an electric current applied to
Gate-Level Circuits
the coil
Boolean Algebra
■ Activate by an electric x = 1

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 5/44

 Physical Switches: Transistor

Switches
● Electric Circuit
■ This particular transistor is of a type known as metal-oxide
● Electric Circuit
● Physical Switches: Relay
semiconductor-MOS
● Physical Switches: Transistor
■ Input variable x is an electric voltage {VL , VH }
Logic Gates
■ Output variable z is an electric current that takes the binary
Gate-Level Circuits
values {IL , IH }
Boolean Algebra
■ It’s more practical when dealing with MOS transistor circuits
to treat x and z as binary voltages that assume the same set
of values {VL , VH }

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 6/44

Switches

Logic Gates
● A General Definition
● Single-Input Gates
● Single-Input Gates
● Single-Input Gates
● And Gate
● And Gate
Logic Gates
● Or Gate
● Or Gate
● NAND and NOR Gate
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
● XOR Gate
● XOR Gate

Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 7/44

 A General Definition

Switches ■ In general, a logic gate G is a switching circuit characterized

Logic Gates
● A General Definition
by the following parameters:
● Single-Input Gates ◆ A set of n binary input signals or variables
● Single-Input Gates
● Single-Input Gates X = (x1 , x2 , . . . , xn ), where each xi is 0 or 1, and n
● And Gate
● And Gate ranges from 1 to 10 or so
● Or Gate
● Or Gate
◆ A single binary output signal z
● NAND and NOR Gate
◆ A function f from X to z that may be expressed as
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
● XOR Gate
z = f (X) = f (x1 , x2 , . . . , xn )
● XOR Gate

Gate-Level Circuits
◆ and is one of about six basic types
Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 8/44

 Single-Input Gates

Switches ■ Buffer
Logic Gates ◆ Output z is 1 whenever the input x is 1; z is 0 whenever x
● A General Definition
● Single-Input Gates is 0
● Single-Input Gates
● Single-Input Gates z=x
● And Gate
● And Gate
● Or Gate
■ Inverter or NOT gate
● Or Gate
◆ Output z is 0 whenever the input x is 1; z is 1 whenever x
● NAND and NOR Gate
● NAND Gate
● NOR Gate
is 0
● EXCLUSIVE-OR Gate
● XOR Gate
zN OT = x̄
● XOR Gate

Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 9/44

 Single-Input Gates

Switches

Logic Gates
● A General Definition
● Single-Input Gates
x z x z
● Single-Input Gates
● Single-Input Gates
● And Gate
● And Gate
● Or Gate
● Or Gate
Buffer Inverter
● NAND and NOR Gate
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
● XOR Gate
● XOR Gate

Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 10/44

 Single-Input Gates

Switches ■ Buffer
Logic Gates
● A General Definition
Input Output
● Single-Input Gates
● Single-Input Gates
x z
● Single-Input Gates
● And Gate 0 0
● And Gate
● Or Gate 1 1
● Or Gate
● NAND and NOR Gate
● NAND Gate
■ Inverter or NOT gate
● NOR Gate
● EXCLUSIVE-OR Gate
Input Output
● XOR Gate
● XOR Gate x z
Gate-Level Circuits 0 1
Boolean Algebra
1 0

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 11/44

 And Gate

Switches ■ The output of And Gate is 1 if and only if x1 is 1 and x2 is 1

Logic Gates
● A General Definition
and . . . xn is 1.
● Single-Input Gates
● Single-Input Gates
■ In other word, z is 0 if at least one input is 0: it is 1 if all inputs
● Single-Input Gates
● And Gate
are 1.
● And Gate
● Or Gate
■ It can be interprested as the multiplication of a set of 1-bit
● Or Gate
● NAND and NOR Gate
numbers; a 0 among the input values makes the result
● NAND Gate
● NOR Gate
(product) 0
● EXCLUSIVE-OR Gate
● XOR Gate
● XOR Gate
zAN D (x1 , x2 , . . . , xn ) = x1 x2 . . . xn
Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 12/44

 And Gate

Switches ■ Truth table

Logic Gates
● A General Definition
Input Output
● Single-Input Gates
● Single-Input Gates
x1 x2 . . . xn−1 xn z
● Single-Input Gates
● And Gate 0 0 ... 0 0 0
● And Gate
● Or Gate 0 0 ... 0 1 0
● Or Gate
● NAND and NOR Gate 0 0 ... 1 0 0
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
0 0 ... 1 1 0
● XOR Gate
● XOR Gate
...
Gate-Level Circuits 1 1 ... 1 0 0
Boolean Algebra 1 1 ... 1 1 1

x1
x2
xn
Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 13/44
 Or Gate

Switches ■ The output of Or Gate is 1 if and only if x1 is 1 or x2 is 1 or

Logic Gates
● A General Definition
. . . xn is 1.
● Single-Input Gates
● Single-Input Gates
■ In other word, z is 1 if at least one input is 1: it is 0 if all inputs
● Single-Input Gates
● And Gate
are 0.
● And Gate
● Or Gate
■ It can be interprested as the summation of a set of 1-bit
● Or Gate
● NAND and NOR Gate
numbers; a 0 among the input values makes the result (sum)
● NAND Gate
● NOR Gate
0
● EXCLUSIVE-OR Gate
● XOR Gate
zOR (x1 , x2 , . . . , xn ) = x1 + x2 · · · + xn
● XOR Gate

Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 14/44

 Or Gate

Switches ■ Truth table

Logic Gates
● A General Definition
Input Output
● Single-Input Gates
● Single-Input Gates
x1 x2 . . . xn−1 xn z
● Single-Input Gates
● And Gate 0 0 ... 0 0 0
● And Gate
● Or Gate 0 0 ... 0 1 1
● Or Gate
● NAND and NOR Gate 0 0 ... 1 0 1
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
0 0 ... 1 1 1
● XOR Gate
● XOR Gate
...
Gate-Level Circuits 1 1 ... 1 0 1
Boolean Algebra 1 1 ... 1 1 1

x1
x2
xn
Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 15/44
 NAND and NOR Gate

Switches ■ Append NOT to AND and OR, respectively.

Logic Gates
● A General Definition
● Single-Input Gates
zN AN D (x1 , x2 , . . . , xn ) = x1 x2 . . . xn
● Single-Input Gates
● Single-Input Gates zN OR (x1 , x2 , . . . , xn ) = x1 + x2 + · · · + xn
● And Gate
● And Gate
● Or Gate
● Or Gate
● NAND and NOR Gate
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
● XOR Gate
● XOR Gate

Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 16/44

 NAND Gate

Switches ■ Truth table

Logic Gates
● A General Definition
Input Output
● Single-Input Gates
● Single-Input Gates
x1 x2 . . . xn−1 xn z
● Single-Input Gates
● And Gate 0 0 ... 0 0 1
● And Gate
● Or Gate 0 0 ... 0 1 1
● Or Gate
● NAND and NOR Gate 0 0 ... 1 0 1
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
0 0 ... 1 1 1
● XOR Gate
● XOR Gate
...
Gate-Level Circuits 1 1 ... 1 0 1
Boolean Algebra 1 1 ... 1 1 0

x1
x2
xn
Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 17/44
 NOR Gate

Switches ■ Truth table

Logic Gates
● A General Definition
Input Output
● Single-Input Gates
● Single-Input Gates
x1 x2 . . . xn−1 xn z
● Single-Input Gates
● And Gate 0 0 ... 0 0 1
● And Gate
● Or Gate 0 0 ... 0 1 0
● Or Gate
● NAND and NOR Gate 0 0 ... 1 0 0
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
0 0 ... 1 1 0
● XOR Gate
● XOR Gate
...
Gate-Level Circuits 1 1 ... 1 0 0
Boolean Algebra 1 1 ... 1 1 0

x1
x2
xn
Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 18/44
 EXCLUSIVE-OR Gate

Switches ■ EXCLUSIVE-OR is easily specified in terms of the parity of

Logic Gates
● A General Definition
the number of 1s among the n input variables:
● Single-Input Gates
● Single-Input Gates
● Single-Input Gates
● And Gate
● And Gate
● Or Gate
if and odd number of inputs are 1
● Or Gate
● NAND and NOR Gate
● NAND Gate
zXOR (x1 , x2 , . . . , xn ) = 1
● NOR Gate
● EXCLUSIVE-OR Gate
● XOR Gate otherwise
● XOR Gate

Gate-Level Circuits zXOR (x1 , x2 , . . . , xn ) = 0

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 19/44

 XOR Gate

Switches ■ Truth table

Logic Gates
● A General Definition
Input Output
● Single-Input Gates
● Single-Input Gates
x1 x2 . . . xn−1 xn z
● Single-Input Gates
● And Gate 0 0 ... 0 0 0
● And Gate
● Or Gate 0 0 ... 0 1 1
● Or Gate
● NAND and NOR Gate 0 0 ... 1 0 1
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
0 0 ... 1 1 0
● XOR Gate
● XOR Gate
...
Gate-Level Circuits 1 1 ... 1 0 1
Boolean Algebra 1 1 ... 1 1 0

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 20/44

 XOR Gate

Switches ■ XOR
Logic Gates
● A General Definition
zXOR (x1 , x2 , . . . , xn ) = x1 ⊕ x2 ⊕ · · · ⊕ xn
● Single-Input Gates
● Single-Input Gates
● Single-Input Gates x1
● And Gate
● And Gate
● Or Gate
x2
● Or Gate
● NAND and NOR Gate
● NAND Gate
● NOR Gate
● EXCLUSIVE-OR Gate
xn
● XOR Gate
● XOR Gate

Gate-Level Circuits

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 21/44

Switches

Logic Gates

Gate-Level Circuits
● Combinational Circuits
● Gate-level design for a full
adder
● Full adder
● Gate-level design for a full
Gate-Level Circuits
adder
● Fan-in and Fan-out
● Meeting Fan-in and Fan-out
● Meeting Fan-in and Fan-out

Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 22/44

 Combinational Circuits

Switches ■ Combinational Circuits are obtained by connecting two or

Logic Gates
more gates, if their time-dependent behavior is ignored.
Gate-Level Circuits
● Combinational Circuits
■ An n-input, m-output combinational circuit N is a multigate
● Gate-level design for a full
adder
circuit that realizes a set of m ≥ 1 functions:
● Full adder
● Gate-level design for a full
adder F = (f1 (X), f2 (X), . . . , fm (X)
● Fan-in and Fan-out
● Meeting Fan-in and Fan-out
● Meeting Fan-in and Fan-out where X = (x1 , x2 , . . . , xn ) and each fi is a binary function
Boolean Algebra of the form fi : X → zi for 1 ≥ i ≥ m

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 23/44

 Gate-level design for a full adder

Switches ■ Three-input, two-output combinational circuit

Logic Gates
■ F (X) = (f1 (x1 , x2 , x3 ), f2 (x1 , x2 , x3 ))
Gate-Level Circuits
● Combinational Circuits ■ This full adder consists of three AND gates, an OR gate,
● Gate-level design for a full
adder
● Full adder
and an EXCLUSIVE-OR gate.
● Gate-level design for a full
adder
● Fan-in and Fan-out x1 y1
● Meeting Fan-in and Fan-out
● Meeting Fan-in and Fan-out

Boolean Algebra x2 y2 f1 (carry)

x3 y3

f2 (sum)

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 24/44

 Full adder

Switches ■ We can define these five equations:

Logic Gates

Gate-Level Circuits
f1 = y1 + y2 + y3
● Combinational Circuits
● Gate-level design for a full y1 = x1 x2
adder
● Full adder
● Gate-level design for a full
y2 = x2 x3
adder
● Fan-in and Fan-out y3 = x1 x3
● Meeting Fan-in and Fan-out
● Meeting Fan-in and Fan-out
f2 = x1 ⊕ x2 ⊕ x3
Boolean Algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 25/44

 Gate-level design for a full adder

Switches ■ Truth table

Logic Gates Input Output
Gate-Level Circuits
● Combinational Circuits
x1 x2 x3 f1 f2
● Gate-level design for a full
adder 0 0 0 0 0
● Full adder
● Gate-level design for a full
adder
0 0 1 0 1
● Fan-in and Fan-out
● Meeting Fan-in and Fan-out 0 1 0 0 1
● Meeting Fan-in and Fan-out

Boolean Algebra
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 26/44

 Fan-in and Fan-out

Switches ■ A physical device can absorb or produce only certain

Logic Gates
amount of energy without failing
Gate-Level Circuits ◆ This places an upper bound on the number of input
● Combinational Circuits
● Gate-level design for a full sources that may supply isgnals to a gate G.
adder
● Full adder ◆ And also palce the maximum number of output devices
● Gate-level design for a full
adder
● Fan-in and Fan-out
that may be supplied with signals by G’s output line.
● Meeting Fan-in and Fan-out
● Meeting Fan-in and Fan-out
■ The number of input lines connected from other gates of G is
Boolean Algebra
termed its fan-in.
■ The number of output lines connected to other gates is
termed its fan-out.

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 27/44

 Meeting Fan-in and Fan-out

Switches

Logic Gates

Gate-Level Circuits
● Combinational Circuits
● Gate-level design for a full
adder
● Full adder
● Gate-level design for a full
adder
● Fan-in and Fan-out
● Meeting Fan-in and Fan-out
● Meeting Fan-in and Fan-out

Boolean Algebra

Figure 1: Increasing fan-in

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 28/44

 Meeting Fan-in and Fan-out

Switches

Logic Gates

Gate-Level Circuits
● Combinational Circuits
● Gate-level design for a full
adder
● Full adder
● Gate-level design for a full
adder
● Fan-in and Fan-out
● Meeting Fan-in and Fan-out
● Meeting Fan-in and Fan-out

Boolean Algebra

1
1
1
1

Figure 2: Decreasing fan-in

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 29/44

Switches

Logic Gates

Gate-Level Circuits

Boolean Algebra
● Basic Operations
● Boolean Expressions
● Axioms&Theorems of
Boolean Algebra
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 30/44

 Basic Operations

Switches
■ 0̄ = 1 and 1̄ = 0
Logic Gates
■ 0 · 0 = 0, 0 · 1 = 0, 1 · 0 = 0, 1 · 1 = 1
Gate-Level Circuits

Boolean Algebra
■ 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, 1 + 1 = 1
● Basic Operations
● Boolean Expressions
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 31/44

 Boolean Expressions

Switches ■ Boolean expressions are formed by application of basic

Logic Gates
operations to one or more variables or constants.
Gate-Level Circuits
■ The simplest consists of a single constant or variable, such
Boolean Algebra
● Basic Operations as 0, X, or Ȳ
● Boolean Expressions
● Axioms&Theorems of ■ More complicated using AND or OR, or by complementing
Boolean algebra
● Axioms&Theorems of another expression.
Boolean algebra
● Axioms&Theorems
Boolean algebra
of ■ Examples of expressions are:
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of AB̄ + C
Boolean algebra
● Axioms&Theorems of
Boolean algebra A(C + D) + BC
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 32/44

 Axioms&Theorems of Boolean algebra

Switches ■ Identity
Logic Gates

Gate-Level Circuits
X +0=X
Boolean Algebra
● Basic Operations
X ·1=X
● Boolean Expressions
● Axioms&Theorems
Boolean algebra
of ■ Null
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of X +1=1
Boolean algebra
● Axioms&Theorems
Boolean algebra
of
X ·0=0
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of ■ Idempotency
Boolean algebra
● Axioms&Theorems of
Boolean algebra X +X =X
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
X ·X =X
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 33/44

 Axioms&Theorems of Boolean algebra

Switches ■ Involution law

Logic Gates
¯ =X
X̄
Gate-Level Circuits

Boolean Algebra
● Basic Operations
(X ′ )′ = X
● Boolean Expressions
● Axioms&Theorems
Boolean algebra
of
■ Complementariy
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of X + X̄ = 1
Boolean algebra
● Axioms&Theorems of
Boolean algebra X · X̄ = 0
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems
Boolean algebra
of ■ Commutativity
● Axioms&Theorems of
Boolean algebra
● Informal Proofs X +Y =Y +X
● Formal Proofs
● Well-Formed Expression X ·Y =Y ·X
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 34/44

 Axioms&Theorems of Boolean algebra

Switches ■ Associativity
Logic Gates

Gate-Level Circuits
(X + Y ) + Z = X + (Y + Z)
Boolean Algebra
● Basic Operations
(X · Y ) · Z = X · (Y · Z)
● Boolean Expressions
● Axioms&Theorems
Boolean algebra
of
■ Distributivity
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of X · (Y + Z) = (X · Y ) + (X · Z)
Boolean algebra
● Axioms&Theorems
Boolean algebra
of
X + (Y · Z) = (X + Y ) · (X + Z)
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 35/44

 Axioms&Theorems of Boolean algebra

Switches ■ Uniting
Logic Gates

Gate-Level Circuits
(X · Y ) + (X · Y ′ ) = X · (Y + Y ′ )
Boolean Algebra
● Basic Operations
=X ·1
● Boolean Expressions
● Axioms&Theorems of =X
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems
Boolean algebra
of
(X + Y ) · (X + Y ′ ) = X + (Y · Y ′ )
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
=X +0
Boolean algebra
● Axioms&Theorems of =X
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 36/44

 Axioms&Theorems of Boolean algebra

Switches ■ Absorption
Logic Gates

Gate-Level Circuits
X +X ·Y =X
Boolean Algebra
● Basic Operations
X · (X + Y ) = X
● Boolean Expressions
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems
Boolean algebra
of
(X + Y ′ ) · Y = X · Y
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
(X · Y ′ ) + Y = X + Y
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 37/44

 Axioms&Theorems of Boolean algebra

Switches ■ Factoring
Logic Gates

Gate-Level Circuits
(X + Y ) · (X ′ + Z) = X · Z + X ′ · Y
Boolean Algebra
● Basic Operations
X · Y + X ′ · Z = (X + Z) · (X ′ + Y )
● Boolean Expressions
● Axioms&Theorems
Boolean algebra
of
■ Concensus
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of X · Y + Y · Z + X′ · Z = X · Y + X′ · Z
Boolean algebra
● Axioms&Theorems
Boolean algebra
of
(X + Y ) · (Y + Z) · (X ′ + Z) = (X + Y ) · (X ′ + Z)
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 38/44

 Axioms&Theorems of Boolean algebra

Switches ■ de Morgan’s
Logic Gates

Gate-Level Circuits
(X + Y + . . . )′ = (X ′ · Y ′ . . . )
Boolean Algebra
● Basic Operations
(X · Y · . . . )′ = (X ′ + Y ′ + . . . )
● Boolean Expressions
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 39/44

 Informal Proofs

Switches ■ We can interpret the theorems into terms of logic circuits or

Logic Gates
set theory.
Gate-Level Circuits
■ For example: A · A = A and A + A = A
Boolean Algebra
● Basic Operations
● Boolean Expressions
b=a b=a
● Axioms&Theorems
Boolean algebra
of
a a
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of c=a c=a
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 40/44

 Formal Proofs

Switches ■ A+A=A
Logic Gates

Gate-Level Circuits
A+A=A
Boolean Algebra
● Basic Operations
(A + A) · 1 = A
● Boolean Expressions
● Axioms&Theorems of (A + A) · (A + A′ ) = A
Boolean algebra
● Axioms&Theorems
Boolean algebra
of
A · A + A · A′ + A · A + A · A′ = A
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
A+0+A+0=A
Boolean algebra
● Axioms&Theorems of A+0=A
Boolean algebra
● Axioms&Theorems of
Boolean algebra A=A
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 41/44

 Well-Formed Expression

Switches ■ Let β be a Boolean algebra with element set K and operator

Logic Gates
set θ = {+, ·, ′}
Gate-Level Circuits ◆ The simplest valid or well-formed (WF) Boolean
Boolean Algebra
● Basic Operations
expression on β is a single variable or constant symbol,
● Boolean Expressions where a constant is any member of K.
● Axioms&Theorems of
Boolean algebra ◆ We can construct general WF expressions by repeated
● Axioms&Theorems of
Boolean algebra application of the following recursive rule:
● Axioms&Theorems of
Boolean algebra ■ If E1 , E2 , . . . , Ek are WF boolean expressions, then so
● Axioms&Theorems of
Boolean algebra are all expressions of the form (E1 + E2 + · · · + Ek ),
(E1 E2 . . . Ek ), (E¯1 )
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 42/44

 Fully Parenthesized WF: FPWF

Switches ■ FPWF is WFs that use parentheses to define the scope of

Logic Gates
each AN D, OR, and N OT operations.
Gate-Level Circuits

Boolean Algebra
● Basic Operations
● Boolean Expressions
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 43/44

 Axioms&Theorems of Boolean algebra

Switches ■ Duality
Logic Gates ◆ Dual of a Boolean expression is derived by replacing · by
Gate-Level Circuits +, + by ·, 0 by 1, and 1 by 0, and leaving variables
Boolean Algebra
● Basic Operations
unchanged
● Boolean Expressions ◆ Any theorem that can be proven is thus also proven for its
● Axioms&Theorems of
Boolean algebra dual!
● Axioms&Theorems of
Boolean algebra ◆ Meta-theorem (a theorem about theorems)
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Axioms&Theorems of
Boolean algebra
● Informal Proofs
● Formal Proofs
● Well-Formed Expression
● Fully Parenthesized WF:
FPWF
● Axioms&Theorems of
Boolean algebra

Sukree Sinthupinyo, December 12, 2006 Logic Elements - p. 44/44