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

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

AMTH140 Lecture 8. Symbolic Logic

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

Number Theory and Proof Methods

Number Theory and Proof Methods

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

CSC Discrete Math I, Spring Propositional Logic

Sequences & Mathematical Induction

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

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

Solutions to Homework I (1.1)

Compound Propositions

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

1. Propositions: Contrapositives and Converses

ANALYSIS EXERCISE 1 SOLUTIONS

Conditional Statements

Section 1.2: Conditional Statements

CISC-102 Winter 2016 Lecture 17

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese

Chapter 1: The Logic of Compound Statements. January 7, 2008

2 Conditional and Biconditional Propositions

Definition 2. Conjunction of p and q

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

Lecture : Set Theory and Logic

Section 1.2: Propositional Logic

Mathematical Logic Part One

Sec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs

Logic & Logic Agents Chapter 7 (& Some background)

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

Introduction to Decision Sciences Lecture 2

1.1 Language and Logic

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

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Today s Topic: Propositional Logic

A Statement; Logical Operations

Discrete Mathematics

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

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

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

2-4: The Use of Quantifiers

Propositional Logic: Semantics

Recitation 4: Quantifiers and basic proofs

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

2.2: Logical Equivalence: The Laws of Logic

Propositional Equivalence

DISCRETE MATH: LECTURE 3

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem

Discrete Structures for Computer Science

Discrete Structures of Computer Science Propositional Logic I

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

Unit 2: Logic and Reasoning. start of unit

CSE 20 DISCRETE MATH. Winter

Logic and Proofs. Jan COT3100: Applications of Discrete Structures Jan 2007

Propositional natural deduction

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

Geometry: Notes

DISCRETE MATH: FINAL REVIEW

Introduction. Applications of discrete mathematics:

Geometry - Chapter 2 Corrective 1

Mustafa Jarrar. Machine Learning Linear Regression. Birzeit University. Mustafa Jarrar: Lecture Notes on Linear Regression Birzeit University, 2018

Discrete Mathematics and Its Applications

Lecture 02: Propositional Logic

Logic. Def. A Proposition is a statement that is either true or false.

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

Propositional Logic. Spring Propositional Logic Spring / 32

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

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Introduction to Proofs

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

CPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

Propositional Logic. Fall () Propositional Logic Fall / 30

2 Truth Tables, Equivalences and the Contrapositive

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04

Value Constraints In ORM

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

Boolean Logic. CS 231 Dianna Xu

To reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

LECTURE 1. Logic and Proofs

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

COMP Intro to Logic for Computer Scientists. Lecture 3

Proofs. Joe Patten August 10, 2018

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 =

THE LOGIC OF COMPOUND STATEMENTS

1.1 Language and Logic

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

Part 2 Module 2 The Conditional Statement. A conditional statement is a statement of the form "If p, then q,"

Transcription:

9/18/17 Mustafa Jarrar: Lecture Notes in Discrete Mathematics. Birzeit University Palestine 2017 Propositional Logic 2.1. Introduction and Basics 2.2 Conditional Statements 2.3 Inferencing 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 2 in Discrete Mathematics with Applications by Susanna S. Epp (3rd Edition). 2 1

If-Then Statements If 4686 is divisible by 6 then 4686 is divisible by 3 hypothesis conclusion If you study then you pass hypothesis conclusion 3 If-Then Statements Remark that this if-then is a logical (not a causal) condition Your mam said {you study you pass} is it True? T F T T you studied and you passed you studied and you didn t passed you didn t study and you passed you didn t study and you didn t pass If p and q are statement variables the conditional of q by p is If p then q or p implies q and is denoted p q. It is false when p is true and q is false; otherwise it is true. We call p the hypothesis (or antecedent) of the conditional and q the conclusion (or consequent). 4 2

Conditional Statement with a False Hypothesis If 0 = 1 then 1 = 2. The statement as whole is true. Notice that we don t test the correctness of the conclusion 5 Truth Tables involving Construct a truth table for the statement form p q p. 6 3

Logical Equivalences involving Division into Cases: Showing that p q r (p r) (q r) 7 Representation of If-Then As Or p q p q? 8 4

The Negation of a Conditional Statement The negation of if p then q is logically equivalent to p and not q. (p q) p q (p q) ( p q) ( p) ( q) p q by De Morgan s laws by the double negative law 9 The Negation of a Conditional Statement If my lecture is at TEC109 then I cannot buy coffee my lecture is at TEC109 and I can buy coffee If Amjad loves Zatar then Amjad is smart Amjad loves Zatar and Amjad is not smart 10 5

The Contrapositive of a Conditional Statement Conditional statement = its contrapositive. If you don t pass the you didn t study Try the truth table 11 The Contrapositive of a Conditional Statement If my lecture is at TEC109 then I cannot buy coffee If I can buy coffee then my lecture is not at TEC109 If Amjad loves Zatar then Amjad is smart If Amjad is not smart then Amjad does not love Zatar 12 6

Converse and Inverse of a Conditional Statement 13 Converse and Inverse of a Conditional Statement If my lecture is at TEC109 then I cannot buy coffee Converse: If I cannot buy coffee then my lecture is at TEC109 Inverse: If my lecture is not at TEC109 then I can buy coffee If Amjad loves Zatar then Amjad is smart Converse: If Amjad is smart then Amjad loves Zatar Inverse: If Amjad does not love Zatar then Amjad is not smart 14 7

Converse and Inverse of a Conditional Statement Caution! Many people believe that if a conditional statement is true then its converse and inverse must also be true. This is not correct! 1.A conditional statement and its converse are not logically equivalent. 2. A conditional statement and its inverse are not logically equivalent. 3. The converse and the inverse of a conditional statement are logically equivalent to each other. 15 Only If and the Biconditional p only if q means that p can take place only if q takes place also 16 8

Only If and the Biconditional 17 Only If and the Biconditional You get an ID card only if you are above 16 If you are not above 16 Then you don t get an ID card If you got an ID card then you must be above 16 18 9

Only If and the Biconditional This computer program is correct if and only if it produces correct answers for all possible sets of input data. If this program produces the correct answers for all possible sets of input data then it is correct. If this program is correct then it produces the correct answers for all possible sets of input data; 19 20 10

Necessary and Sufficient Conditions Studying is a sufficient condition for passing. Being above 16 is a necessary condition for getting ID Card 21 11