George Boole 1815-1864. Set Theory More Set Theory – Union (“OR”) X is the set of men, Y is the set of women X + Y = ? Y + X = ?

Slides:



Advertisements
Similar presentations
 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
Advertisements

Lecture 5 EGRE 254 1/28/09. 2 Boolean algebra a.k.a. “switching algebra” –deals with Boolean values -- 0, 1 Positive-logic convention –analog voltages.
CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
ECE 331 – Digital System Design
Boolean Algebra Discussion D6.1 Sections 13-3 – 13-6.
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR
Boolean Algebra Discussion D2.2. Boolean Algebra and Logic Equations George Boole Switching Algebra Theorems Venn Diagrams.
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. Binary Logic and Gates Binary variables take on one of two values. Logical operators operate on binary values and binary variables. Basic.
طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.
CHAPTER 2 Boolean Algebra
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Binary Logic and Gates Binary variables take on one of two values.
©2004 Brooks/Cole FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in.
Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
6 - 1 Simplification Theorems Useful for simplification of expressions & therefore simplification of the logic network which results. XY + XY' = ( X +
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.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Introduction to Set theory. Ways of Describing Sets.
Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.
Boolean Algebra – II. Outline  Basic Theorems of Boolean Algebra  Boolean Functions  Complement of Functions  Standard Forms.
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.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
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 
Boolean Algebra and Logic Gates CSE-1108 Ahsanullah University of Science and Technology (AUST)
BOOLEAN ALGEBRA Kamrul Ahsan Teacher of
Properties of Sets Lecture 26 Section 5.2 Tue, Mar 6, 2007.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
Discrete Mathematics. Set Theory - Definitions and notation A set is an unordered collection of elements. Some examples: {1, 2, 3} is the set containing.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2002 Topic2: DeMorgan Laws José Nelson Amaral.
BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.
Discrete Mathematics CS 2610 January 27, part 2.
ELEC Digital Logic Circuits Fall 2015 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
CEC 220 Digital Circuit Design Boolean Algebra II Fri, Sept 4 CEC 220 Digital Circuit Design Slide 1 of 13.
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
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.
Properties of Algebra. 7 + ( ) = ( ) + 9.
Boolean Algebra How gates get picked. Boolean Arithmetic Boolean ≠ Binary – Boolean – 1/0 only, no places Boolean addition:
ECE 301 – Digital Electronics
Computer Code.
Discrete Structures – CNS 2300
Discrete Mathematical The Set Theory
Boolean Algebra.
CHAPTER 2 Boolean Algebra
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Boolean Algebra.
SLIDES FOR CHAPTER 2 BOOLEAN ALGEBRA
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
ECE/CS 352 Digital Systems Fundamentals
Lecture 3: Boolean Algebra
Boolean Algebra.
Set Operations Section 2.2.
Boolean Algebra.
Propositional Equivalences
February 7, 2002 John Wawrzynek
Boolean Algebra Introduction CSCI 240
COMS 361 Computer Organization
Faculty of Cybernetics, Statistics and Economic Informatics
Instructor: Alexander Stoytchev
BOOLEAN ALGEBRA.
PRIZE SHOW Advanced Geometry Unit 2 Intro to Logic & Proofs.
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Boolean Algebra S.SADHISH PRABHU.
Presentation transcript:

George Boole

Set Theory

More Set Theory – Union (“OR”) X is the set of men, Y is the set of women X + Y = ? Y + X = ?

More Set Theory – Intersection (“AND”) X is the set of living things, Y is the set of cats X.Y = ? Y.X = ?

Even More Set Theory – Fundamental Equation X is the set of cats X.X = ? X.X = X What numbers work?

Set Theory – Summary X + Y = Y + X X. X = X X. Y = Y. X X + Y = Y + X X. X = X X. Y = Y. X Sets Numbers

Involution Identity Idempotent Complement Commutativity Associativity Distributivity Absorption DeMorgan

Proof using Truth Tables X 0 1 XY XY

X X 0 1

X Y XY

X Y X Y

Finger Exercise 1

Finger Exercise 2

AB House Alarm Problem A house alarm has a sensor on the door (A) and a pressure pad inside the house (B). The logical values of the sensors are: A = 1 the door is closed A = 0 the door is open B = 1 someone is on the pressure pad B = 0 no-one is on the pressure pad The alarm sounds when the door is open, or if someone is on the pressure pad, or both

AB distributive complement redundancy distributive complement House Alarm Problem (ctd)