IST 4 Information and Logic

Size: px
Start display at page:

Download "IST 4 Information and Logic"

Transcription

1 IST 4 Information and Logic

2 T = today x= hw#x out x= hw#x due mon tue wed thr fri 30 M1 1 6 oh M1 oh 13 oh 1 oh 2M2M 20 oh oh 2 Mx= MQx out 27 oh M2 h T oh = office hours oh T oh 3 4 oh oh midterms oh Mx= MQx due 18 oh oh oh 5 oh oh oh

3 So far True for any Boolean Algebra T0: duality principle T1: Single complement per element L1: self Absorption

4 Boolean Algebra It is all about syntax... Boolean editing

5 Absorption Theorem Theorem 2:

6 Absorption Theorem Theorem 2: Can delete anything!!

7 Absorption Theorem Theorem 2: Can delete anything!!

8 Absorption Theorem Theorem 2: Can insert anything!!

9 Absorption Theorem Theorem 2: Proof: A1 A4

10 Absorption Theorem Theorem 2: Proof: A1 A4?? A1 Q

11 Lemma 2: Simple Absorption A proof of a theorem can help in identifying useful lemmas

12 Simple Absorption Lemma 2: Proof: Q A1 A3 A2 A4 A3 A1 A2

13 Absorption Theorem A proof of a theorem can help in identifying useful lemmas Theorem 2: Proof: A1 A4 Lemma 2 Q A1

14 Proofs are FUN Not every proof...

15 My Ranking of Proofs Correct and short Wrong and fun Correct but painful Wrong and long

16

17

18

19

20

21

22

23

24 Boolean wisdom Ppp Proofs are fun: Be patient t and crack it! Mary Boole

25 Boolean Algebra Now it is your turn

26 The Positive Win:

27 The Positive Win: Proof: A4 A2 A3 A1 Q

28 Boolean Algebra One more...

29 Derive the answer? A3 A4 A2 A1

30 B wins: The positive win: Absorption:

31 Next? Current state

32 Boolean Algebra associativity does not need to be an axiom

33 Associativity Theorem Theorem 3: Proof: (d (ideas) We will prove the other one follows by duality

34 Associativity Theorem Theorem 3: Proof: (d (ideas) So far we have seen linear proofs Arrows are axioms, lemmas, theorems...

35 Associativity Theorem Theorem 3: Proof: (d (ideas) A nonlinear proof has an architecture

36 Associativity Theorem Theorem 3: Proof: (d (ideas) A nonlinear proof has an architecture Prove 1 Prove

37 Associativity Theorem Theorem 3: Proof: (d (ideas) A nonlinear proof has an architecture Prove 1 Prove

38 Associativity Theorem Theorem 3: Proof: (d (ideas) A nonlinear proof has an architecture Prove 1 Prove multiply

39 Associativity Theorem Theorem 3: Proof: (d (ideas) A nonlinear proof has an architecture Prove 1 Prove 2 Prove 3 and multiply

40 Associativity Theorem Theorem 3: Proof: B wins: Prove 1 Prove 2 Prove 3 and multiply

41 Prove 1 T2 T2 T2 A4 text editor Q

42 Prove 2 Will appear in HW#3

43 Associativity Theorem Theorem 3: Proof: Q Proved 1 Prove 2 HW#3 Proved 3 and multiply

44 Boolean Algebra DeMorgan Theorem The complements of the sum and product

45 DeMorgan Theorem Theorem 4: We will prove the other one follows by duality

46 DeMorgan Theorem Proof: Need to prove: Need to prove that and are complements

47 DeMorgan Theorem Proof: Need to prove: Need to prove that Need to prove: HW#3 and are complements Idea: need to validate A2 next

48 DeMorgan Theorem A4 Q HW#3 A3 T3 A2 L2 L1 Q T3.

49 DeMorgan Theorem Theorem 4: Q: Simple proof of DeMorgan without Associativity?? Michael Gottlieb IST Brian Lawrence IST We will prove

50 DeMorgan Theorem Proof with Associativity: Q is 0 HW#3 A4 Identify a lemma A2 L2 A3 T3 L1 Q T3.

51 Proof of the lemma: DeMorgan Theorem Proof without Associativity: is 0 A1 A2 A3 A3 A2 A4 T2 A3

52 So Far so Good...

53 Syllogism to Algebra George Boole, 1847 George Boole

54 George Boole George Boole Early Days Born in Lincoln, England an industrial town His father was a shoemaker with a passion for mathematics and science When George was 8 he surpassed his father s knowledge in mathematics By age 14 he was fluent in Latin, German, French, Italian and English and algebra When his was 15 he had to go to work to support his family, he became a math teacher in the Wesleyan Methodist academy in Doncaster (40 miles ) Lost his job after two years. Lost two more teaching jobs When he was 20 he opened his own school in his hometown - Lincoln

55 George Boole George Boole Early Career Born in Lincoln, England an industrial town In 1841 (26) he published three papers in the newly established Cambridge Mathematical Journal (edited by DG). In 1844 (29) he published On a General Method of Analysis ; he considered it to be his best paper. This paper won the first (newly established) Gold medal for Mathematics awarded by Royal Society In 1846 (31) he applied for a professor position in the newly established Queen s College 3 campuses in Ireland In 1847 (32) while waiting to hear from Ireland, he published The Mathematical Analysis of Logic source: wikipedia

56 George Boole George Boole Ireland 8848 m 29,029 ft Born in Lincoln, England an industrial town In 1847 (32) while waiting i to hear from Ireland, he published The Mathematical Analysis of Logic In 1849 (34), his was offered a position of the first professor of mathematics at Queen s college at Cork He married Mary Everest ( ) in 1855 (23,40) and they had five daughters Niece of George Everest (Mt. Everest ) led the expedition to map the Himalayas In 1864, died of pneumonia (49) source: wikipedia

57 , taught at at Queen s college in Cork George Boole Geography Born in Lincoln, England an industrial town source: wikipedia

58 : lived here until got married Cork, Ireland Source:

59

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic T = today mon tue wed thr 3 M1 oh 1 fri sun x= hw#x out 10 oh M1 17 oh oh 1 2 M2 oh oh x= hw#x due 24 oh oh 2 Mx= MQx out 1 oh M2 oh = office hours oh T 8 3 15 oh 3 4 oh oh

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 21 oh oh 2 oh Mx= MQx out 28 oh M2 oh oh = office hours 5 3 12 oh 3 4 oh oh T midterms oh

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic HW2 will be returned today Average is 53/6~=88% T = today x= hw#x out x= hw#x due mon tue wed thr fri 3 M 6 oh M oh 3 oh oh 2M2M 2 oh oh 2 Mx= MQx out 27 oh M2 oh oh = office

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic mon tue wed thr fri sun T = today 3 M oh x= hw#x out oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh T M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh

More information

ELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2)

ELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) ELEC 2200-002 Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic MQ1 Everyone has a gift! Due Today by 10pm Please email PDF lastname-firstname.pdf to ta4@paradise.caltech.edu HW #1 Due Tuesday, 4/12 2:30pm in class T = today x= hw#x out

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic mon tue wed thr fri sun T = today 3 M oh x= hw#x out oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic MQ1 Computers outperform the human brain? Due Today by 10pm Have your name inside the file as well... Please email PDF lastname-firstname.pdf to istta4@paradise.caltech.edu

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 30 M1 1 6 oh M1 oh 13 oh 1 oh 2M2M 20 oh oh 2 T Mx= MQx out 27 oh M2 oh oh = office hours 4 3 11 oh 3 4 oh oh midterms

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic mon tue wed thr fri sun T = today 3 M oh x= hw#x out 0 oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic T = today x= hw#x out mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 oh x= hw#x due 21 oh oh 2 T Mx= MQx out 28 oh M2 oh oh = office hours 5 3 12 oh 3 4 oh oh midterms oh

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic MQ1 Everyone has a gift! Due Today by 10pm Please email PDF lastname-firstname.pdf to ta4@paradise.caltech.edu HW #1 Due Tuesday, 4/14 230 2:30pm in class T = today x= hw#x

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic Lectures are at: paradise.caltech.edu/ist4/lectures.html edu/ist4/lectures html Homeworks are at: paradise.caltech.edu/ist4/homeworks.html edu/ist4/homeworks html T = today

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logi T = today x= hw#x out x= hw#x due mon tue wed thr fri 3 M 7 oh M 4 oh oh 2M2 2 oh oh 2 oh 28 oh M2 oh oh = offie hours 5 3 Mx= MQx out 2 oh 3 4 oh oh midterms oh Mx= MQx due

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic Quizzes grade (6): average of top n-2 T = today x= hw#x out x= hw#x due mon tue wed thr fri 1 M1 oh 1 8 oh M1 15 oh 1 T 2 oh M2 22 oh PCP oh 2 oh sun oh 29 oh M2 oh = office

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 3 M 7 oh M 4 oh oh 2M2 2 oh oh 2 oh T Mx= MQx out 28 oh M2 oh oh = office hours 5 3 2 oh 3 4 oh oh midterms oh Mx= MQx

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 30 M 6 oh M oh 3 oh oh 2M2M 20 oh oh 2 27 oh M2 oh midterms Students MQ oh = office hours Mx= MQx out 4 3 oh 3 4 oh oh

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic Lectures are at: paradise.caltech.edu/ist4/lectures.html edu/ist4/lectures html Homeworks are at: paradise.caltech.edu/ist4/homeworks.html edu/ist4/homeworks html T = today

More information

CprE 281: Digital Logic

CprE 281: Digital Logic CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Boolean Algebra CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev

More information

CNS 188a Computation Theory and Neural Systems. Monday and Wednesday 1:30-3:00 Moore 080

CNS 188a Computation Theory and Neural Systems. Monday and Wednesday 1:30-3:00 Moore 080 CNS 88a Computation Theory and Neural Systems Monday and Wednesday :30-3:00 Moore 080 Lecturer: Shuki Bruck; 33 Moore office hours: Mon, Wed, 3-4pm TAs: Vincent Bohossian, Matt Cook; 3 Moore office hours:

More information

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of

More information

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:

More information

Unit 2 Boolean Algebra

Unit 2 Boolean Algebra Unit 2 Boolean Algebra 1. Developed by George Boole in 1847 2. Applied to the Design of Switching Circuit by Claude Shannon in 1939 Department of Communication Engineering, NCTU 1 2.1 Basic Operations

More information

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PROPOSITIONAL LOGIC

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PROPOSITIONAL LOGIC 1 CHAPTER 4. PROPOSITIONAL LOGIC 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PROPOSITIONAL LOGIC 1 Propositional Logic 1.1 Introduction George Boole, mathematician, logician

More information

General Info. Grading

General Info. Grading Syllabus & Policies General Info Lecture 1: Introduction, Set Theory, and Boolean Algebra Classroom: Perkins 2-072 Time: Mon - Fri, 2:00-3:15 pm Wed, 3:30-4:30 pm Sta 111 Colin Rundel May 13, 2014 Professor:

More information

BOOLEAN ALGEBRA THEOREMS

BOOLEAN ALGEBRA THEOREMS OBJECTIVE Experiment 4 BOOLEAN ALGEBRA THEOREMS The student will be able to do the following: a. Identify the different Boolean Algebra Theorems and its properties. b. Plot circuits and prove De Morgan

More information

Exercise Set 2.1. Notes: is equivalent to AND ; both statements must be true for the statement to be true.

Exercise Set 2.1. Notes: is equivalent to AND ; both statements must be true for the statement to be true. Exercise Set 2.1 10) Let p be the statement DATAENDFLAG is off, q the statement ERROR equals 0, and r the statement SUM is less than 1,000. Express the following sentences in symbolic notation. Notes:

More information

Grade 7/8 Math Circles November 28/29/30, Math Jeopardy

Grade 7/8 Math Circles November 28/29/30, Math Jeopardy Faculty of Mathematics Waterloo, Ontario N2L 3G1 Introduction Grade 7/8 Math Circles November 28/29/30, 2017 Math Jeopardy Centre for Education in Mathematics and Computing Questions will vary in difficulty

More information

Switches: basic element of physical implementations

Switches: basic element of physical implementations Combinational logic Switches Basic logic and truth tables Logic functions Boolean algebra Proofs by re-writing and by perfect induction Winter 200 CSE370 - II - Boolean Algebra Switches: basic element

More information

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA 3 Boolean Algebra 3.1 BOOLEAN ALGEBRA In 1854, George Boole introduced the following formalism which eventually became Boolean Algebra. Definition. An algebraic system consisting of a set B of elements

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

Math/EECS 1028M: Discrete Mathematics for Engineers Winter Suprakash Datta

Math/EECS 1028M: Discrete Mathematics for Engineers Winter Suprakash Datta Math/EECS 1028M: Discrete Mathematics for Engineers Winter 2017 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.eecs.yorku.ca/course/1028 Administrivia

More information

4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra

4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra 4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra To design a digital circuit that will perform a required function, it is necessary to manipulate and combine the various input signals in certain

More information

INTRO TO I & CT. (Boolean Algebra and Logic Simplification.) Lecture # By: Department of CS & IT.

INTRO TO I & CT. (Boolean Algebra and Logic Simplification.) Lecture # By: Department of CS & IT. INTRO TO I & CT. (Boolean Algebra and Logic Simplification.) Lecture # 13-14 By: M.Nadeem Akhtar. Department of CS & IT. URL: https://sites.google.com/site/nadeemcsuoliict/home/lectures 1 Boolean Algebra

More information

This form sometimes used in logic circuit, example:

This form sometimes used in logic circuit, example: Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from

More information

CSE 140, Lecture 2 Combinational Logic CK Cheng CSE Dept. UC San Diego

CSE 140, Lecture 2 Combinational Logic CK Cheng CSE Dept. UC San Diego CSE 140, Lecture 2 Combinational Logic CK Cheng CSE Dept. UC San Diego 1 Combinational Logic Outlines 1. Introduction 1. Scope 2. Review of Boolean lgebra 3. Review: Laws/Theorems and Digital Logic 2.

More information

Set Theory Basics of Set Theory. mjarrar Watch this lecture and download the slides

Set Theory Basics of Set Theory. mjarrar Watch this lecture and download the slides 9/6/17 Birzeit University Palestine 2015 6.1. Basics of 6.2 Properties of Sets and Element Argument 6.3 Algebraic Proofs mjarrar 2015 1 Watch this lecture and download the slides Course Page: http://www.jarrar.info/courses/dmath/

More information

= x ( x 2 4 ) [factor out x] (2)

= x ( x 2 4 ) [factor out x] (2) Connexions module: m10717 1 Part IIc: Propositional Logic 1 Propositional Equivalences What are the roots of x 3 4x? Well, in high-school algebra you learned how to deal with such numeric formulas: x 3

More information

Telescopes and Observatories. Parent Guide, page 1 of 2. OurStory: Exploring the Sky. Read the Directions sheets for step-by-step instructions.

Telescopes and Observatories. Parent Guide, page 1 of 2. OurStory: Exploring the Sky. Read the Directions sheets for step-by-step instructions. Parent Guide, page 1 of 2 Read the Directions sheets for step-by-step instructions. SUMMARY In this activity, children and adults will watch and discuss a short video about how people use telescopes. WHY

More information

Truth and Logic. Brief Introduction to Boolean Variables. INFO-1301, Quantitative Reasoning 1 University of Colorado Boulder

Truth and Logic. Brief Introduction to Boolean Variables. INFO-1301, Quantitative Reasoning 1 University of Colorado Boulder Truth and Logic Brief Introduction to Boolean Variables INFO-1301, Quantitative Reasoning 1 University of Colorado Boulder February 13, 2017 Prof. Michael Paul Prof. William Aspray Overview This lecture

More information

. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra

. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra . T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION 2016-17 SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued

More information

GCE. Mathematics. Mark Scheme for June Advanced GCE Unit 4737: Decision Mathematics 2. Oxford Cambridge and RSA Examinations

GCE. Mathematics. Mark Scheme for June Advanced GCE Unit 4737: Decision Mathematics 2. Oxford Cambridge and RSA Examinations GCE Mathematics Advanced GCE Unit 737: Decision Mathematics 2 Mark Scheme for June 2013 Oxford Cambridge and RSA Examinations OCR (Oxford Cambridge and RSA) is a leading UK awarding body, providing a wide

More information

Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 Linear, Compound, and Absolute Value Inequalities

Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 Linear, Compound, and Absolute Value Inequalities Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 What is the following symbol? < The inequality symbols < > are used to compare two real numbers. The meaning of anyone of

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Informtion nd Logic T = tody x= hw#x out x= hw#x due mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 21 oh oh 2 oh Mx= MQx out Mx= MQx due 28 oh M2 oh oh = office hours 5 3 12 oh 3 T 4 oh oh 19

More information

Logic Design. Chapter 2: Introduction to Logic Circuits

Logic Design. Chapter 2: Introduction to Logic Circuits Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic

More information

Digital Circuit And Logic Design I. Lecture 3

Digital Circuit And Logic Design I. Lecture 3 Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong

More information

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational

More information

CS 226: Digital Logic Design

CS 226: Digital Logic Design CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions

More information

Date: Tuesday, 17 November :00PM. Location: Museum of London

Date: Tuesday, 17 November :00PM. Location: Museum of London Hamilton, Boole and their Algebras Transcript Date: Tuesday, 17 November 2015-1:00PM Location: Museum of London 17 November 2015 Hamilton, Boole and their Algebras Professor Raymond Flood Thank you for

More information

Boolean Algebra CHAPTER 15

Boolean Algebra CHAPTER 15 CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an

More information

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS

More information

Lab 1 starts this week: go to your session

Lab 1 starts this week: go to your session Lecture 3: Boolean Algebra Logistics Class email sign up Homework 1 due on Wednesday Lab 1 starts this week: go to your session Last lecture --- Numbers Binary numbers Base conversion Number systems for

More information

Digital Systems and Information Part II

Digital Systems and Information Part II Digital Systems and Information Part II Overview Arithmetic Operations General Remarks Unsigned and Signed Binary Operations Number representation using Decimal Codes BCD code and Seven-Segment Code Text

More information

The Comparison Test. J. Gonzalez-Zugasti, University of Massachusetts - Lowell

The Comparison Test. J. Gonzalez-Zugasti, University of Massachusetts - Lowell The Comparison Test The Comparison Test Let a k and b k be series with positive terms and suppose a N b N, a N+ b N+, a N+2 b N+2,, a) If the bigger series b k converges, then the smaller series a k also

More information

EEE130 Digital Electronics I Lecture #4

EEE130 Digital Electronics I Lecture #4 EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean

More information

CPE100: Digital Logic Design I

CPE100: Digital Logic Design I Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter

More information

Computer Organization: Boolean Logic

Computer Organization: Boolean Logic Computer Organization: Boolean Logic Representing and Manipulating Data Last Unit How to represent data as a sequence of bits How to interpret bit representations Use of levels of abstraction in representing

More information

Group 5. Jeremy Gutierrez. Jesus Ochoa Perez. Alvaro Gonzalez. MATH 170: Discrete Mathematics. Dr. Lipika Deka. March 14, 2014.

Group 5. Jeremy Gutierrez. Jesus Ochoa Perez. Alvaro Gonzalez. MATH 170: Discrete Mathematics. Dr. Lipika Deka. March 14, 2014. Gutierrez, Perez, & Gonzalez 1 Group 5 Jeremy Gutierrez Jesus Ochoa Perez Alvaro Gonzalez MATH 170: Discrete Mathematics Dr. Lipika Deka March 14, 2014 Project Part 1 Gutierrez, Perez, & Gonzalez 2 Hello

More information

Srinivasa Ramanujan Life and Mathematics

Srinivasa Ramanujan Life and Mathematics Life and Mathematics Universität Wien (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) born 22 December 1887 in Erode (Madras Presidency = Tamil Nadu) named Iyengar (1887

More information

3. Abstract Boolean Algebras

3. Abstract Boolean Algebras 3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,

More information

Logic Gate Level. Part 2

Logic Gate Level. Part 2 Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively

More information

Binary Logic and Gates

Binary Logic and Gates 1 COE 202- Digital Logic Binary Logic and Gates Dr. Abdulaziz Y. Barnawi COE Department KFUPM 2 Outline Introduction Boolean Algebra Elements of Boolean Algebra (Binary Logic) Logic Operations & Logic

More information

2010 Teacher Created Resources, Inc.

2010 Teacher Created Resources, Inc. Editor Erica N. Russikoff, M.A. Illustrator Clint McKnight Cover Artist Brenda DiAntonis Editor in Chief Ina Massler Levin, M.A. Creative Director Karen J. Goldfluss, M.S. Ed. Art Coordinator Renée Christine

More information

Truth-Functional Logic

Truth-Functional Logic Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence

More information

Chapter-2 BOOLEAN ALGEBRA

Chapter-2 BOOLEAN ALGEBRA Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.

More information

Exam Session 2 (13:00 EDX IAL) PM: EDX - IAL. ****Revision**** Yr 11. Maths 10:45 to 11:45

Exam Session 2 (13:00 EDX IAL) PM: EDX - IAL. ****Revision**** Yr 11. Maths 10:45 to 11:45 Date Day External Examination timetable 2015 for A Level. CIE Key times: AM 12 noon, PM 4pm Date Day Exam Session 1 (09:30 EDX IAL, 11:00 EDX others) AM: EDX - GCE, GCSE, IGCSE AM: CIE Some Exams 1st May

More information

Math 3336: Discrete Mathematics Practice Problems for Exam I

Math 3336: Discrete Mathematics Practice Problems for Exam I Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing

More information

Inventors and Scientists: Marie Curie

Inventors and Scientists: Marie Curie Inventors and Scientists: Marie Curie By Big History Project, adapted by Newsela staff on 06.15.16 Word Count 1,993 Level 920L Marie Curie in 1898. BELOW: Marie Curie in her laboratory in 1905. Bettmann/CORBIS

More information

2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS

2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital

More information

Week 1 Factor & Remainder Past Paper Questions - SOLUTIONS

Week 1 Factor & Remainder Past Paper Questions - SOLUTIONS Question Solution Marks C2 JUNE 2010 Q2 f(3) = 3(3) 3 5(3) 2 58(3) + 40 f(3) = 98 So, the remainder is 98 Substitute x = 3 into 98 (If it is not stated that 98 is the remainder, do not give this C2 JUNE

More information

Digital Design 2. Logic Gates and Boolean Algebra

Digital Design 2. Logic Gates and Boolean Algebra Digital Design 2. Logic Gates and oolean lgebra József Sütő ssistant Lecturer References: [1] D.M. Harris, S.L. Harris, Digital Design and Computer rchitecture, 2nd ed., Elsevier, 213. [2] T.L. Floyd,

More information

Digital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.

Digital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus. Chapter 2 Digital Electronics Objectives 1. Understand the operation of basic digital electronic devices. 2. Understand how to describe circuits which can process digital data. 3. Understand how to design

More information

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S. BOOLEAN ALGEBRA 2.1 Introduction Binary logic deals with variables that have two discrete values: 1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and transistor

More information

Be careful of that wasp: it might sting. Every triangle has three sides. The figure I drew is a triangle. Therefore my figure must have three sides.

Be careful of that wasp: it might sting. Every triangle has three sides. The figure I drew is a triangle. Therefore my figure must have three sides. Deductive Reasoning Deductive Reasoning Is the process of drawing conclusions from given information by using rules of logic. You must be able to support any statement you make. Be careful of that wasp:

More information

Deductive and Inductive Logic

Deductive and Inductive Logic Deductive Logic Overview (1) Distinguishing Deductive and Inductive Logic (2) Validity and Soundness (3) A Few Practice Deductive Arguments (4) Testing for Invalidity (5) Practice Exercises Deductive and

More information

The life and work of Marie Curie

The life and work of Marie Curie The life and work of Marie Curie Marie Curie is probably the most famous woman scientist who has ever lived. Born Maria Sklodowska in Poland in 1867, she is famous for her work on radioactivity, and was

More information

Functions on Finite Fields, Boolean Functions, and S-Boxes

Functions on Finite Fields, Boolean Functions, and S-Boxes Functions on Finite Fields, Boolean Functions, and S-Boxes Claude Shannon Institute www.shannoninstitute.ie and School of Mathematical Sciences University College Dublin Ireland 1 July, 2013 Boolean Function

More information

Course Staff. Textbook

Course Staff. Textbook Course Staff CS311H: Discrete Mathematics Intro and Propositional Logic Instructor: Işıl Dillig Instructor: Prof. Işıl Dillig TAs: Jacob Van Geffen, Varun Adiga, Akshay Gupta Class meets every Monday,

More information

Computer Organization I

Computer Organization I Computer Organization I Lecture 6: Boolean Algebra /2/29 Wei Lu CS283 Overview Two Principles in Boolean Algebra () Duality Principle (2) Complement Principle Standard Form of Logic Expression () Sum of

More information

E&CE 223 Digital Circuits & Systems. Winter Lecture Transparencies (Introduction) M. Sachdev

E&CE 223 Digital Circuits & Systems. Winter Lecture Transparencies (Introduction) M. Sachdev E&CE 223 Digital Circuits & Systems Winter 2004 Lecture Transparencies (Introduction) M. Sachdev 1 of 38 Course Information: People Instructor M. Sachdev, CEIT 4015, ext. 3370, msachdev@uwaterloo.ca Lab

More information

Equational Logic and Term Rewriting: Lecture I

Equational Logic and Term Rewriting: Lecture I Why so many logics? You all know classical propositional logic. Why would we want anything more? Equational Logic and Term Rewriting: Lecture I One reason is that we might want to change some basic logical

More information

when r x when x 5 9 Was the expression evaluated correctly using the order of operations? If not, find and correct the error.

when r x when x 5 9 Was the expression evaluated correctly using the order of operations? If not, find and correct the error. Practice A For use with pages 8 13 Name the operation that would be performed first. 1. 18 2 5 1 12 2. 5 p 8 4 4 3. 27 4 (14 2 5) 4. 36 4 4 p 3 5. 8 1 10 4 5 2 3 6. 4 p (7 2 3) 2 7. 15 2 8 1 4 8. 13 2

More information

It is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party =

It is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party = Introduction to Propositional Logic Propositional Logic (PL) is a logical system that is built around the two values TRUE and FALSE, called the TRUTH VALUES. true = 1; false = 0 1. Syntax of Propositional

More information

Chapter 1 :: From Zero to One

Chapter 1 :: From Zero to One Chapter 1 :: From Zero to One Digital Design and Computer Architecture David Money Harris and Sarah L. Harris Copyright 2007 Elsevier 1- Chapter 1 :: Topics Background The Game Plan The Art of Managing

More information

George Boole Encyclopedia.com

George Boole Encyclopedia.com encyclopedia.com George Boole Encyclopedia.com Complete Dictionary of Scientific Biography COPYRIGHT 2008 Charles Scribner's Sons 22-28 minutes (b. Lincoln, England, 1815; d. Cork, Ireland, 1864) mathematics.

More information

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before

More information

Math 211 Lecture Notes: Sections

Math 211 Lecture Notes: Sections Math 211 Lecture Notes: Sections 1.1-1.3 Richard Blecksmith 1. Math 211 Business Calculus Section 1 Summer, 2009 Mon, Tues, Wed, Thurs 8:00-9:15 a.m. Reavis Hall 201 Independence Day Holiday is Wednesday,

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma

More information

ECE380 Digital Logic. Axioms of Boolean algebra

ECE380 Digital Logic. Axioms of Boolean algebra ECE380 Digital Logic Introduction to Logic Circuits: Boolean algebra Dr. D. J. Jackson Lecture 3-1 Axioms of Boolean algebra Boolean algebra: based on a set of rules derived from a small number of basic

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Informtion nd Logic T = tody x= hw#x out x= hw#x due mon tue wed thr 28 M1 oh 1 4 oh M1 11 oh oh 1 2 M2 18 oh oh 2 fri oh oh = office hours oh 25 oh M2 2 3 oh midterms oh Mx= MQx out 9 oh 3 T 4 oh

More information

Stat 451: Solutions to Assignment #1

Stat 451: Solutions to Assignment #1 Stat 451: Solutions to Assignment #1 2.1) By definition, 2 Ω is the set of all subsets of Ω. Therefore, to show that 2 Ω is a σ-algebra we must show that the conditions of the definition σ-algebra are

More information

Combinational Logic Design Principles

Combinational Logic Design Principles Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems

More information

Uptake of IGCSE subjects 2012

Uptake of IGCSE subjects 2012 Uptake of IGCSE subjects 2012 Statistics Report Series No.63 Tom Sutch September 2013 Research Division Assessment, Research and Development Cambridge Assessment 1 Regent Street, Cambridge, CB2 1GG Introduction

More information

Combinational Logic Fundamentals

Combinational Logic Fundamentals Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic

More information

INTRODUCTION TO INFORMATION & COMMUNICATION TECHNOLOGY LECTURE 8 : WEEK 8 CSC-110-T

INTRODUCTION TO INFORMATION & COMMUNICATION TECHNOLOGY LECTURE 8 : WEEK 8 CSC-110-T INTRODUCTION TO INFORMATION & COMMUNICATION TECHNOLOGY LECTURE 8 : WEEK 8 CSC-110-T Credit : (2 + 1) / Week TEXT AND REF. BOOKS Text Book: Peter Norton (2011), Introduction to Computers, 7 /e, McGraw-Hill

More information

COS 140: Foundations of Computer Science

COS 140: Foundations of Computer Science COS 140: Foundations of Computer Science Boolean Algebra Fall 2018 Introduction 3 Problem................................................................. 3 Boolean algebra...........................................................

More information

Binary Logic and Gates. Our objective is to learn how to design digital circuits.

Binary Logic and Gates. Our objective is to learn how to design digital circuits. Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values

More information

CS1800 Discrete Structures Fall 2017 October, CS1800 Discrete Structures Midterm Version A

CS1800 Discrete Structures Fall 2017 October, CS1800 Discrete Structures Midterm Version A CS1800 Discrete Structures Fall 2017 October, 2017 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic

More information

The life and work of Marie Curie

The life and work of Marie Curie Reading Practice The life and work of Marie Curie Marie Curie is probably the most famous woman scientist who has ever lived. Born Maria Sklodowska in Poland in 1867, she is famous for her work on radioactivity,

More information

Lecture 3: Boolean Algebra

Lecture 3: Boolean Algebra Lecture 3: Boolean Algebra Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Prof. Russell Tessier of University of Massachusetts Aby George of Wayne State University Overview

More information