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

Similar documents
Set Theory Basics of Set Theory. 6.2 Properties of Sets and Element Argument. 6.3 Algebraic Proofs 6.4 Boolean Algebras.

Number Theory and Proof Methods

Propositional Logic Introduction and Basics. 2.2 Conditional Statements. 2.3 Inferencing. mjarrar 2015

Relations Introduction to Relations 8.2 Properties of Relations. 8.3 Equivalence Relations. mjarrar 2015

AMTH140 Lecture 8. Symbolic Logic

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Number Theory and Proof Methods

2.2: Logical Equivalence: The Laws of Logic

Solutions to Homework I (1.1)

Boolean Algebra. Philipp Koehn. 9 September 2016

Sequences & Mathematical Induction

Doc112: Hardware. Department of Computing, Imperial College London. Doc112: Hardware Lecture 1 Slide 1

EEE130 Digital Electronics I Lecture #4

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

CSC Discrete Math I, Spring Propositional Logic

Propositional Calculus: Formula Simplification, Essential Laws, Normal Forms

1.3 Propositional Equivalences

Logic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae

CISC-102 Winter 2016 Lecture 17

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Computer Organization: Boolean Logic

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 THEOREMS

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

COS 140: Foundations of Computer Science

Propositional Equivalence

CS 226: Digital Logic Design

Boolean Algebra, Gates and Circuits

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

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST

Compound Propositions

Slides for Lecture 10

Logic Synthesis and Verification

Topic 1: Propositional logic

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

Logic and Boolean algebra

Unit 8A Computer Organization. Boolean Logic and Gates

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

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

Switches: basic element of physical implementations

Digital Logic (2) Boolean Algebra

Tautologies, Contradictions, and Contingencies

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

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

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

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

Unit 2 Boolean Algebra

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

Propositional natural deduction

Lecture 3: Boolean Algebra

CISC-102 Fall 2018 Week 11

CHAPTER III BOOLEAN ALGEBRA

Propositional Logic. Spring Propositional Logic Spring / 32

Chapter 4, Logic using Propositional Calculus Handout

Lab 1 starts this week: go to your session

Logic Design. Chapter 2: Introduction to Logic Circuits

PHIL12A Section answers, 16 February 2011

Boolean algebra. Values

CHAPTER III BOOLEAN ALGEBRA

4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra

Boolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.

Section 1.1: Logical Form and Logical Equivalence

Logic Gate Level. Part 2


ICS141: Discrete Mathematics for Computer Science I

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

1. Name the person who developed Boolean algebra

1 Predicates and Quantifiers

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

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

CHAPTER 2 BOOLEAN ALGEBRA

CprE 281: Digital Logic

CS 173 Lecture 2: Propositional Logic

This form sometimes used in logic circuit, example:

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Chapter 2: Switching Algebra and Logic Circuits

Midterm Exam Solution

Logic and Proofs. (A brief summary)

CSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

A statement is a sentence that is definitely either true or false but not both.

Logic As Algebra COMP1600 / COMP6260. Dirk Pattinson Australian National University. Semester 2, 2017

Equivalence and Implication

A. Propositional Logic

1.1 Statements and Compound Statements

Slide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Logic: Propositional Logic (Part I)

Propositional Logics and their Algebraic Equivalents

We last time we began introducing equivalency laws.

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA

Digital Circuit And Logic Design I. Lecture 3

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

CSE 20 DISCRETE MATH. Fall

Truth-Functional Logic

CSE 311: Foundations of Computing. Lecture 2: More Logic, Equivalence & Digital Circuits

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

Unit 2 Boolean Algebra

Transcription:

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 Online Courses at: http://www.jarrar.info Acknowledgement: This lecture is based on (but not limited to) to chapter 5 in Discrete Mathematics with Applications by Susanna S. Epp (3rd Edition). 2 1

Birzeit University Palestine 2015 In this lecture: qpart 1: History of Algebra qpart 2: What is Boolean Algebra qpart 3: Proving Boolean Algebra Properties 3 What is Algebra? Al-Khwarizmi 850 780 (Baghdad) Developed an advanced arithmetical system with which they were able to do calculations in an algorithmic fashion. The Compendious Book on Calculation by Completion and Balancing Statements to describe relationships between things Symbols and the rules for manipulating these symbols )? جبر) Do you know any algebra 4 2

Birzeit University Palestine 2015 In this lecture: qpart 1: History of Algebra qpart 2: What is Boolean Algebra qpart 3: Proving Boolean Algebra Properties 5 Boolean Algebra Introduced by George Boole in his first book The Mathematical Analysis of Logic (1847) A structure abstracting the computation with the truth values false and true. George Boole 1815-1864 England Instead of elementary algebra where the values of the variables are numbers and the main operations are addition and multiplication the main operations of Boolean algebra are the conjunction ( ) the disjunction ( ) and the negation not ( ). Used extensively in the simplification of logic Circuits 6 3

Compare Logical Equivalences For all statement variables p qandr: Set Properties For all sets A B andc: a. p q q p a. A B = B A b. p q q p b. A B = B A a. p (q r) p (q r) a. A (B C) A (B C) b. p (q r) p (q r) b. A (B C) A (B C) a. p (q r) (p q) (p r) a. A (B C) (A B) (A C) b. p (q r) (p q) (p r) b. A (B C) (A B) (A C) a. p c p a. A = A b. p t p b. A U = A a. p p t a. A A c = U b. p p c b. A A c = ( p) p Both are special cases of the same general (A c ) c = A structure known as a Boolean Algebra. a. p p p a. A A = A b. p p p b. A A = A a. p t t a. A U = U b. c c b. = 7 Boolean Algebra Definition: Boolean Algebra A Boolean algebra is a set B together with two operations generally denoted + and suchthatforalla and b in B both a + b and a b are in B and the following properties hold: 1. Commutative Laws: For all a and b in B (a) a + b = b + a and (b) a b = b a. 2. Associative Laws: For all a b andc in B (a) (a + b) + c = a + (b + c) and (b) (a b) c = a (b c). 3. Distributive Laws: For all a b and c in B (a) a + (b c) = (a + b) (a + c) and (b) a (b + c) = (a b) + (a c). 4. Identity Laws: There exist distinct elements 0 and 1 in B such that for all a in B (a) a + 0 = a and (b) a 1 = a. 5. Complement Laws: For each a in B there exists an element in B denoted a and called the complement or negation of a suchthat (a) a + a = 1 and (b)a a = 0. 8 4

Properties of a Boolean Algebra Theorem 6.4.1 Properties of a Boolean Algebra Let B be any Boolean algebra. 1. Uniqueness of the Complement Law: For all a and x in B ifa + x = 1and a x = 0thenx = a. 2. Uniqueness of 0 and 1: If there exists x in B such that a + x = a for all a in B then x = 0 and if there exists y in B such that a y = a for all a in Btheny = 1. 3. Double Complement Law: For all a B (a) = a. 4. Idempotent Law: For all a B 5. Universal Bound Law: For all a B (a) a + a = a and (b) a a = a. (a) a + 1 = 1 and (b) a 0 = 0. 6. De Morgan s Laws: For all a and b B 7. Absorption Laws: For all a and b B 8. Complements of 0 and 1: (a) a + b = a b and (b) a b = a + b. (a) (a + b) a = a and (b) (a b) + a = a. (a) 0 = 1 and (b)1 = 0. continued on page 376 9 Birzeit University Palestine 2015 In this lecture: qpart 1: History of Algebra qpart 2: What is Boolean Algebra qpart 3: Proving Boolean Algebra Properties 10 5

Proving of Boolean Algebra Properties Proof: Suppose a and x are particular but arbitrarily chosen elements of B that satisfy the following hypothesis: a + x = 1 and a x = 0. Then 11 Proving of Boolean Algebra Properties Suppose B is a Boolean algebra and a is any element of B. Then and 12 6