CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.

Slides:



Advertisements
Similar presentations
1 CSE 20 – Discrete Math Lecture 10 CK Cheng 4/28/2010.
Advertisements

Boolean Algebra cont’ The digital abstraction Graphs and Topological Sort מבנה המחשב + מבוא למחשבים ספרתיים תרגול 2#
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
מבנה המחשב + מבוא למחשבים ספרתיים תרגול 1#
Boolean Algebra Module M4.1 Section 5.1. Boolean Algebra and Logic Equations Switching Algebra Theorems Venn Diagrams.
Lecture 1: Introduction to Digital Logic Design CK Cheng Thursday 9/26/02.
1 CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng 4/26/2011.
Boolean Algebra cont’ The digital abstraction מבנה המחשב + מבוא למחשבים ספרתיים תרגול 2#
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Algebraic Properties: The Rules of Algebra Be Cool - Follow The Rules!
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
CHAPTER 2 Boolean Algebra
Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
Boolean Algebras Lecture 27 Section 5.3 Wed, Mar 7, 2007.
CSE 20: Lecture 7 Boolean Algebra CK Cheng
1.2 Field Axioms (Properties) Notes on a Handout.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS.
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 (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.
ELEC Digital Logic Circuits Fall 2015 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and.
by D. Fisher (2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition 1.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
PROPERTIES OF REAL NUMBERS. COMMUTATIVE PROPERTY OF ADDITION What it means We can add numbers in any order Numeric Example Algebraic Example
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Properties Objective: To use the properties of numbers. Do Now 1.) = 3.) ( 2  1 )  4 = 2.) =4.) 2  ( 1  4 ) =
Review. Boolean Algebra.
by D. Fisher (2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition 1.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
Properties A property is something that is true for all situations.
Boolean Algebra. Laws of Boolean Algebra Commutative LawExpression Addition: A + B = B + A Multiplication: A B = B A Associative Addition: A + (B+C) =
Boolean Algebras Lecture 24 Section 5.3 Wed, Mar 22, 2006.
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.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
Boolean Algebra How gates get picked. Boolean Arithmetic Boolean ≠ Binary – Boolean – 1/0 only, no places Boolean addition:
Hoda Roodaki Boolean Algebra Hoda Roodaki
7.1 De Morgan's Laws Bond Chapter 7.1 Part 2.
Set Theory.
Linear Algebra Lecture 2.
Boolean Algebra.
Properties of Operations
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
CHAPTER 1 : INTRODUCTION
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Lecture 3: Boolean Algebra
Algebraic Properties.
Boolean Algebra.
Basic Logic Gates 1.
Boolean Algebra.
CSE 370 – Winter Combinational Logic - 1
Properties of Real Numbers
Properties of Real Numbers
CSE 20 Lecture 9 Boolean Algebra: Theorems and Transformations
Boolean Algebra Introduction CSCI 240
Properties of Real Numbers
CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng
Boolean Algebra How gates get picked.
Boolean Algebra: Theorems and Proofs
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Boolean Algebra: Theorems and Proofs
Presentation transcript:

CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1

Theorems & Proofs P1: a+b = b+a, ab=ba (commutative) P2: a+bc = (a+b)(a+c) (distributive) a(b+c) = ab + ac P3: a+0=a, a1 = a (identity) P4: a+a’=1, a a’= 0 (complement) 2

Theorem 6 (Involution Laws): For every element a in B, (a')' = a Proof: a is one complement of a'. The complement of a' is unique Thus a = (a')' Theorem 7 (Absorption Law): For every pair a,b in B, a·(a+b) = a; a + a·b = a. Proof: a(a+b) = (a+0)(a+b) (P3) = a+0·b (P2) = a + 0 (P3) = a (P3) 3

Theorem 8: For every pair a, b in B a + a’*b = a + b;a*(a’ + b) = a*b Proof: a + a’*b = (a + a’)*(a + b) (P2) = (1)*(a + b) (P4) = (a + b) (P3) 4 Theorems and Proofs

Theorem 9: De Morgan’s Law Theorem: For every pair a, b in set B: (a+b)’ = a’b’, and (ab)’ = a’+b’. Proof: We show that a+b and a’b’ are complementary. In other words, we show that both of the following are true (P4): (a+b) + (a’b’) = 1, (a+b)(a’b’) = 0. 5

Theorem 9: De Morgan’s Law (cont.) 6 Proof (Continue): (a+b)+(a’b’) =(a+b+a’)(a+b+b’) (P2) =(1+b)(a+1) (P4) =1 (Theorem 3) (a+b)(a’b’) =(a’b’)(a+b) (P1) =a’b’a+a’b’b (P2) =0*b’+a’*0 (P4) =0+0 (Theorem 3) =0 (P3)

5. Switching Algebra vs. Multiple Valued Boolean Algebra Boolean Algebra is termed Switching Algebra when B = {0, 1} When |B| > 2, the system is multiple valued. – Example: M = {(0, 1, 2, 3), #, &} # &

Example: M = {(0, 1, 2, 3), #, &} P1: Commutative Laws – a # b = b # a – a & b = b & a P2: Distributive Laws – a # (b & c) = (a # b) & ( a # c) – a & (b # c) = (a & b) # (a & c) P3: Identity Elements – a # 0 = a – a & 3 = a P4: Complement Laws – a # a’ = 3 – a & a’ = 0 8 # &

6. Boolean Transformation Show that a’b’+ab+a’b = a’+b Proof 1: a’b’+ab+a’b = a’b’+(a+a’)b P2 = a’b’ + b P4 = a’ + b Theorem 8 Proof 2: a’b’+ab+a’b = a’b’+ab+a’b+a’b Theorem 5 = a’b’ + a’b +ab+a’b P1 = a’(b’+b) + (a+a’)b P2 = a’*1 +1*b P4 = a’ + b P3 9

Boolean Transformation (a’b’+c)(a+b)(b’+ac)’ = (a’b’+c)(a+b)(b(ac)’) (DeMorgan’s) = (a’b’+c)(a+b)b(a’+c’) (DeMorgan’s) = (a’b’+c)b(a’+c’) (Absorption) = (a’b’b+bc)(a’+c’) (P2) = (0+bc)(a’+c’) (P4) = bc(a’+c’) (P3) = a’bc+bcc’ (P2) = a’bc+0 (P4) = a’bc (P3) 10