Boolean Algebra M. AL- Towaileb1. Boolean Functions In Boolean algebra we work with the set {0,1}, where: 0 ≡ F (False) & 1 ≡ T (True). The 3 Operations.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Presented by: Ms. Maria Estrellita D. Hechanova, ECE
מבנה המחשב + מבוא למחשבים ספרתיים תרגול 1#
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
Boolean Algebra Module M4.1 Section 5.1. Boolean Algebra and Logic Equations Switching Algebra Theorems Venn Diagrams.
Boolean Algebra cont’ The digital abstraction מבנה המחשב + מבוא למחשבים ספרתיים תרגול 2#
Lattice and Boolean Algebra
Lecture 3. Boolean Algebra, Logic Gates
Algebra Algebra – defined by the tuple:  A, o 1, …, o k ; R 1, …, R m ; c 1, …, c k  Where: A is a non-empty set o i is the function, o i : A p i  A.
Linear Systems The definition of a linear equation given in Chapter 1 can be extended to more variables; any equation of the form for real numbers.
Fall 2002CMSC Discrete Structures1 Yes, No, Maybe... Boolean Algebra.
Boolean Algebra أ. زينب آل كاظم 1. Boolean Functions In Boolean algebra we work with the set {0,1}, where: 0 ≡ F (False) & 1 ≡ T (True). The 3 Operations.
11.1 Boolean Functions. Boolean Algebra An algebra is a set with one or more operations defined on it. A boolean algebra has three main operations, and,
Boolean Functions.
Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,
Boolean Algebra – I. Outline  Introduction  Digital circuits  Boolean Algebra  Two-Valued Boolean Algebra  Boolean Algebra Postulates  Precedence.
Applied Discrete Mathematics Week 13: Boolean Algebra
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
1 Section 10.2 Boolean Algebra Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra of propositional wffs. These.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
CompSci 102 Discrete Math for Computer Science
Discrete Mathematics CS 2610 February 12, Agenda Previously Finished functions Began Boolean algebras And now Continue with Boolean algebras.
--- outputs logical functions of inputs --- new outputs appear shortly after changed inputs (propagation delay) --- no feedback loops --- no clock Sequential.
Discrete Mathematics CS 2610 September Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x 1,..x n )  B.
Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
1 CSE370, Lecture 3 Lecture 3: Boolean Algebra u Logistics u Last lecture --- Numbers n Binary numbers n Base conversion n Number systems for negative.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
ECE2030 Introduction to Computer Engineering Lecture 5: Boolean Algebra Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.
Boolean Algebra.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Basic Laws, theorems, and postulates of Boolean Algebra
CHAPTER 2 Boolean algebra and Logic gates
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3.
Chapter 11 (Part 1): Boolean Algebra
The Foundations: Logic and Proofs
CS 105 Digital Logic Design
CHAPTER 2 Boolean Algebra
… and now for the Final Topic:
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Princess Sumaya University
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Boolean Algebra A Boolean algebra is a set B of values together with:
Boolean Algebra A Boolean algebra is a set B of values together with:
September 7 Notes Boolean Algebra.
Propositional Calculus: Boolean Algebra and Simplification
Set Operations Section 2.2.
Discrete Mathematics CS 2610
Propositional Equivalences
CMSC Discrete Structures
Boolean Algebra L Al-zaid Math1101.
Discrete Math (2) Haiming Chen Associate Professor, PhD
Yes, No, Maybe... BooleanAlgebra 12/10/2018.
Boolean Algebra Introduction CSCI 240
Applied Discrete Mathematics Week 4: Functions
Representing Boolean Functions
COMS 361 Computer Organization
Lecture 3: Boolean Algebra
CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng
Lecture 3: Boolean Algebra
CMSC Discrete Structures
Presentation transcript:

Boolean Algebra M. AL- Towaileb1

Boolean Functions In Boolean algebra we work with the set {0,1}, where: 0 ≡ F (False) & 1 ≡ T (True). The 3 Operations used in Boolean Algebra are: The 3 Operations used in Boolean Algebra are: 1.Complementation ( - ــــــــ, ¬). 2.Boolean sum (+; OR, V). 3.Boolean product(. ; AND, Λ). Where (¬, V, Λ) are the Logical Operations. M. AL- Towaileb 2

The Operations In Boolean Algebra 1.The complementation of an element, denoted with a bar “ - ــــــــ ” is defined by: 2.The sum (+; OR): 1+1=1; 1+0=1; 0+1=1; 0+0=0. 3. Boolean product(. ; AND). 1.1=1, 1.0=0, 0.1=0, 0.0=0 M. AL- Towaileb 3

Example1: Find the value of Solution: Using the definition of operations in Boolean algebra, it follows that: M. AL- Towaileb 4

Translation into a Logical Equivalence 0 ≡ F, 1 ≡ T,. ≡ Λ, + ≡ V, ــــــــ ≡ ¬ M. AL- Towaileb 5

Example 2: Solution: 0 ≡ F, 1 ≡ T,. ≡ Λ, + ≡ V, ــــــــ ≡ ¬ 0 ≡ F, 1 ≡ T,. ≡ Λ, + ≡ V, ــــــــ ≡ ¬ M. AL- Towaileb 6

Example 3: Solution: 0 ≡ F, 1 ≡ T,. ≡ Λ, + ≡ V, ــــــــ ≡ ¬ 0 ≡ F, 1 ≡ T,. ≡ Λ, + ≡ V, ــــــــ ≡ ¬ M. AL- Towaileb 7

Boolean Expressions and Boolean Functions Let B= {0,1}. Then B n ={(x 1, x 2,, x n )/x i ϵB for 1 ≤ i ≤n} is the set of all possible n -tuples of Os and 1s. The variable x is called a Boolean variable if it assumes values only from B, that is, if its only possible values are 0 and 1. A function from B n to B is called a Boolean function of degree n. M. AL- Towaileb 8

EXAMPLE 4 The function from the set of ordered pairs of Boolean variables to the set {0,1} is a Boolean function of degree 2 with F ( 1,1)=0, F (1,0) = 1, F (0,1) = 0, and F(0, 0) = 0. We display these values of F in Table 1. 0 ≡ F, 1 ≡ T,. ≡ Λ, + ≡ V, ــــــــ ≡ ¬ M. AL- Towaileb 9

Boolean Expressions Boolean functions can be represented using expressions made up from variables and Boolean operations (., +, ــــــــ ). The Boolean expressions in the variables x 1, x 2,, x n are defined recursively as 0, 1, x 1, x 2,, x n are Boolean expressions; if E 1 and E 2 are Boolean expressions, then, (E 1.E 2 ), and (E 1 +E 2 ) are Boolean expressions. M. AL- Towaileb 10

EXAMPLE 5 Find the values of the Boolean function represented by Solution: The values of this function are displayed in Table 2. M. AL- Towaileb 11

Equality of Boolean Functios M. AL- Towaileb 12

EXAMPLE 7 How many different Boolean functions of degree n are there? Solution: From the product rule for counting, it follows that there are 2 n different n-tuples of Os and 1 s. Because a Boolean function is an assignment of 0 or 1 to each of these 2 n different n-tuples, the product rule shows that there are different Boolean functions of degree n. M. AL- Towaileb 13

Identities of Boolean Algebra EXAMPLE 8 Show that the distributive law x(y+z)=xy+xz is valid. Solution:. The identity holds because the last two columns of the table agree. M. AL- Towaileb 14

M. AL- Towaileb 15

EXAMPLE 9 Translate the distributive law x+yz=(x+y)(x+z) in Table 5 into a logical equivalence. Solution: Put x≡p, y≡q, & z≡r, and use the translation of Boolean operations This transforms the Boolean identity into the logical equivalence pV(qΛr)≡(pVq)Λ(p Vr). 0 ≡ F, 1 ≡ T,. ≡ Λ, + ≡ V, ــــــــ ≡ ¬ M. AL- Towaileb 16

EXAMPLE 10 Prove the absorption law x(x+y)=x using the other identities of Boolean algebra shown in Table 5 Solution: The steps used to derive this identity and the law used in each step follow: x(x+y)=(x+0)(x+y) Identity law for the Boolean sum = x+0.y Distributive law of the Boolean sum over the Boolean product = x +Y.0 Commutative law for the Boolean product =x+0 Domination law for the Boolean product = x Identity law for the Boolean sum M. AL- Towaileb 17

Duality The dual of a Boolean expression is obtained by interchanging Boolean sums and Boolean products and interchanging Os and 1 s. Duality of a Boolean function F is denoted by F d M. AL- Towaileb 18

EXAMPLE 11 Solution: M. AL- Towaileb 19

Duality Principle An identity between functions represented by Boolean expressions remains valid when the duals of both sides of the identity are taken. This result, called the duality principle, is useful for obtaining new identities. M. AL- Towaileb 20

EXAMPLE 12 Construct an identity from the absorption law x(x+y)=x by taking duals. Solution: Taking the duals of both sides of this identity produces the identity x+xy = x, which is also called an absorption law and is shown in Table 5. M. AL- Towaileb 21

Homework Page 756 1(a), 4(a,b), 5(a), 11, 28(a,d). M. AL- Towaileb 22