Scribd
Upload
4K views

Boolean Algebra

This document discusses Boolean algebra and binary logic. It introduces binary variables that can take on two values, logical operators like AND, OR, and NOT, and logic gates that represent logical functions. Boolean algebra is a useful mathematical system for specifying and transforming logical functions. The foundations of Boolean algebra are important for designing digital systems.

Uploaded by

gbland
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4K views

Boolean Algebra

This document discusses Boolean algebra and binary logic. It introduces binary variables that can take on two values, logical operators like AND, OR, and NOT, and logic gates that represent logical functions. Boolean algebra is a useful mathematical system for specifying and transforming logical functions. The foundations of Boolean algebra are important for designing digital systems.

Uploaded by

gbland
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Boolean Algebra

Instructor:
Khaled Ibrahim
Binary Logic and Gates
„ Binary variables:
„ take on one of two values.
„ Logical operators:
„ operate on binary values and variables
„ Logic gates:
„ are symbolic representation for the logic functions.
„ Boolean Algebra:
„ a useful mathematical system for specifying and
transforming logical functions.
„ We study Boolean Algebra as foundation for
designing digital systems.
Binary Variables
„ The two binary values have different
names:
„ True/False
„ On/Off
„ Yes/No
„ 1/0
„ Variable identifiers:
„ A, B, y, or z,…..
Logical Operations
„ The three basic logical operations are:
„ AND
„ OR
„ NOT
„ AND is denoted by a dot (·)
„ OR is denoted by a plus (+)
„ NOT is denoted by a bar ( ¯ ) over the
variable
Notation Examples
„ Examples:
„ Y = A⋅B is read “Y is equal to A and B.”
„ z = x + y is read “z is equal to x OR y.”
„
X = A is read “X is equal to NOT A.”
Operator Definitions
„ Operations are defined on the values
"0" and "1" for each Operator:
Operator Definitions
„ Using Switches
„ For inputs:
„ logic 1 is switch closed
„ logic 0 is switch open
„ For outputs:
„ logic 1 is light on
„ logic 0 is light off.
Logic Gate Symbols
Truth Tables
„ Truth tables list the output value of a function for all
possible input values
„ Truth tables for basic logic operations:
Logic Diagrams and
Expressions

„ Boolean expressions, truth tables and logic diagrams


describe the same function!
„ Truth tables are unique, expressions and logic
diagrams are not. This gives flexibility in
implementing functions.
Boolean Algebra Rules

A+0 = A
A +1 = 1
A ⋅1 = A
A⋅0 = 0
Boolean Algebra Rules

A+ A = A
A+ A =1
A⋅ A = A
A⋅ A = 0
Boolean Algebra Rules

A = A
A+A⋅B= A
A+ A⋅ B = A+ B
( A + B) ⋅ ( A + C ) = A + B ⋅ C
Boolean Algebra Rules

A+ B = B + A
A⋅B = B⋅ A
A+ (B + C) = ( A+ B) + C
A ⋅ (B ⋅C ) = ( A ⋅ B) ⋅C
Boolean Algebra Rules
A ⋅ (B + C) = A ⋅ B + A ⋅ C

A + B ⋅ C = ( A + B) ⋅ ( A + C )

( A + B) = A ⋅ B

( A ⋅ B) = A + B

You might also like