Discrete Mathematics Dr.-Ing. Erwin Sitompul

Slides:



Advertisements
Similar presentations
08 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Advertisements

CS128 – Discrete Mathematics for Computer Science
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Adapted from Discrete Math
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
Discrete Mathematics and Its Applications
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics Lecture # 7. Bi conditional  If p and q are statement variables, the bi conditional of p and q is  “ p if, and only if, q ” and.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Law of logic Lecture 4.
Discrete Mathematical الرياضيات المتقطعة Dr. Ahmad Tayyar Al Israa University
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Chapter 1 Propositional Logic
Chapter 1 Logic and Proof.
Logic The study of correct reasoning.
Logic.
Discrete Mathematical
2. The Logic of Compound Statements Summary
Conditional Statements
Propositional Logic.
Logic Day #2 Math Studies IB NPHS Miss Rose
DISCRETE MATHEMATICS CHAPTER I.
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSNB 143 Discrete Mathematical Structures
Lecture 1 – Formal Logic.
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Chapter 1 Logic and Proofs Homework 1 Two merchants publish new marketing campaign to attract more customers. The first merchant launches a motto “Good.
CSCE 235 Introduction to Discrete Structures
Truth Tables and Equivalent Statements
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
COMP 1380 Discrete Structures I Thompson Rivers University
Logic.
MATH 245 Spring 2009 This is mathematics for computer science
Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
Negations of Quantified Statements
The Logic of Compound Statements
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
CS100: Discrete structures
Information Technology Department
CHAPTER 1: LOGICS AND PROOF
CS201: Data Structures and Discrete Mathematics I
Section 3.5 Symbolic Arguments
3.5 Symbolic Arguments.
Copyright © Cengage Learning. All rights reserved.
Applied Discrete Mathematics Week 1: Logic
Propositional Logic.
CSE 311 Foundations of Computing I
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Logic.
Discrete Mathematics Dr.-Ing. Erwin Sitompul
Foundations of Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
1.3 Propositional Equivalences
Discrete Structures Prepositional Logic 2
CS201: Data Structures and Discrete Mathematics I
3.5 Symbolic Arguments.
Presentation transcript:

Discrete Mathematics Dr.-Ing. Erwin Sitompul Lecture 2 1. LOGIC AND PROOFS Discrete Mathematics Dr.-Ing. Erwin Sitompul http://zitompul.wordpress.com

? Solution of Homework 1 Solution: p  ~q  q  ~p Two merchants publish new marketing campaign to attract more customers. The first merchant launches a motto “Good stuffs are not cheap”, while the second merchants says “Cheap stuffs are not good”. a) Examine whether both mottos tell the same message or not. b) In your opinion, which motto is better? Solution: Taking p: Good stuffs q: Cheap stuffs then the motto of the first merchant is p  ~q And the one of the second merchant is q  ~p ? p  ~q  q  ~p

Solution of Homework 1  p  ~q  q  ~p The mottos of both merchants are logically equivalent (thus identical).

Variances of Conditional Proposition Converse: q  p Inverse: ~p  ~q Contrapositive: ~q  ~p

Variances of Conditional Proposition Example: Determine the converse, inverse, and contrapositive of: “If Amir owns a car, then he is rich.” Solution: Converse “If Amir is rich, then he owns a car.” Inverse: “If Amir does not own a car, then he is not reach.” Contrapositive: “If Amir is not rich, then Amir does not own a car.” Converse: q  p Inverse: ~p  ~q Contrapositive: ~q  ~p

Contrapositive Example: Solution: Determine the contrapositive of the following propositions: a) “If she is found guilty, then she will be put in prison.” b) “If 6 is greater than 0, then 6 is not a negative number.” c) “Ivan passes the exam only if he studies hard.” p only if q Solution: a) “If she is not put in prison, then she was not found guilty.” b) “If 6 is a negative number, then 6 is not greater than 0.” c) “If Ivan does not study hard, he does not pass the exam.” Contrapositive: ~q  ~p

Contrapositive Example: Solution: p only if q d) “Only if she is not late then she will get the job.” e) “Wind is necessary for the kite to fly.” f) “Rain falling in the afternoon is sufficient to make the night freezing cold. q necessary for p p sufficient for q Solution: d) “If she is late, then she will not get the job.” e) “If the wind does not blow, then the kite cannot fly.” f) “If the night is not freezing cold, then rain does not fall in the afternoon.”

Bi-conditional (Bi-implication) Proposition form: “p if and only if q” Notation: p  q p  q  (p  q)  (q  p)

Bi-conditional (Bi-implication) The form, “p if and only if q” can also be written as “if p then q and if q then p”

Bi-conditional (Bi-implication) Various ways to express bi-implication p  q: p if and only if q. p is the necessary and sufficient condition for q. p is necessary and sufficient for q. if p then q, and conversely (vise versa). if p then q and if q then p. p iff q.

Bi-conditional (Bi-implication) Example: Bi-implication in various expressions 1 + 1 = 2 if and only if 2 + 2 = 4. The necessary and sufficient condition for rain to fall is high air humidity. If you are rich, then you have much money, and vice versa. Cikarang is located in West Java iff West Java is one of 33 provinces in Indonesia. If the weather is hot then I buy ice cream, and if I buy ice cream then the weather is hot.

Bi-conditional (Bi-implication) Example: Bi-implication in various expressions Training and discipline are sufficient and necessary for you to win the match. You are promoted if you have connection, and you have connection if you are promoted. If I watch television too much then my eyes are irritated, and vice versa. Trains always come late when and only when I need them for travel.

Logical Laws for Implication and Bi-implication

Some Examples Example: Solution: Given a proposition “It is not true that he learns Technical Drawing but not State Philosophy.”, a) Express the proposition above in symbolic notation (logical expression). b) Write a logically equivalent proposition as the proposition above (Hint: Use De Morgan’s Law). Solution: Taking p: He learns Technical Drawing. q: He learns State Philosophy. then: a) ~ (p  ~q) b) ~ (p  ~q)  ~ p  q “He does not learn Technical Drawing or indeed learns State Philosophy.”

Some Examples Example: Solution: Three propositions are given to describe the quality of a hotel: p : The service is good. q : The room rate is low. r : The hotel is a three star hotel. Translate the following proposition into symbolic notation using p, q, and r : a) “The room rate is low but the service is bad.” b) “Either the room rate is high or the service is good, but not both.” c) “It is not true that if a hotel is a three star hotel, then the room rate is low and the service is bad.” Solution: a) q  ~p b) ~q  p c) ~ (r  (q ~p)) (~q  ~p )  (q  p)

Some Examples Example: Solution: Express the following statement in symbolic notation: “If you are below 17 years old, then you may not vote in a general election, unless you are already married.” Solution: Defining: p : You are below 17 years old. q : You are already married. r : You may vote in a general election. then the statement above can be express in symbolic notation as: (p  ~q)  ~r “If you are below 17 years old and are not already married, then you may not vote in a general election.”  r  (~p  q)

Some Examples Example: Solution: Proof that [~p  (p  q)]  q is a tautology. Solution: To proof the tautology, we construct the truth table: True in all cases [~p  (p  q)]  q is a tautology.

Argument Argument is a list of propositions written as: In this case, p1, p2, …, pn are denoted as hypothesis (premise) and q as conclusion (consequence) The value of an argument may be valid or invalid. It should be emphasized that valid does not necessarily means true.

Argument Definition: An argument is valid if the conclusion is true, then all the hypotheses are true; otherwise the argument is invalid. If an argument is true, then we can say “the conclusion logically follows the hypotheses; or equivalently showing that the implication: is true. An invalid argument shows false reasoning. (p1  p2    pn)  q

Argument Example: Solution: Show that the argument below is valid: “If a low tide occurs after an underwater earthquake, then a tsunami is triggered.” “A low tide occurs after an underwater earthquake.” “Therefore, a tsunami is triggered.” Solution: Assume: p : A low tide occurs after an underwater earthquake. q : A tsunami is triggered. then the argument can be written as: p  q p  q There are two ways to proof the validity of the argument, both using the truth table, and will be discussed now.

Argument 1st way: p  q p  q Constructing the truth table of p, q, and p  q, and analyzing case by case. : If each case “If all hypotheses are true, then the conclusion is true” applies, then the argument is valid. Let us check whether if hypotheses p  q and p are true, then the conclusion q is also true. See line 1: p  q and p are true at the same time, and q in line 1 is also true. The argument is v a l i d.

Argument 2nd way: p  q p  q Showing that the truth table of [(p  q)  p]  q is a tautology. If the compound proposition is a tautology, then the argument is valid. The argument is v a l i d.

Argument Show that the reasoning of the following argument is false, or the argument is invalid: “If a low tide occurs after an underwater earthquake, then a tsunami is triggered.” “A tsunami is triggered.” “A low tide occurs after an underwater earthquake.” Solution: Assume: p : A low tide occurs after an underwater earthquake. q : A tsunami is triggered. then the argument can be written as: p  q q  p See line 3. Conclusion p is false, even though all the hypotheses are true. Thus, the argument is i n v a l i d.

Homework 2 No.1: Given the statement “A valid password is necessary for you to log on to the campus server.” a) Express the statement above in the proposition form of “if p then q.” b) Determine also the negation, converse, inverse, and contrapositive of the statement. No.2: Check the validity of the argument below: “If 5 is less then 4, then 5 is not a prime number.” “5 is not less then 4.” “5 is a prime number.”

Homework 2 New No.1: Given the statement “If you want to register for consultation with our doctors, you only have to send an SMS to the number on this card.” a) Express the statement above in the proposition form of “If p then q.” b) Determine also the negation, converse, inverse, and contrapositive of the statement. No.2: Check the validity of the argument below: “I will prepare the budget proposal only if you give an initial approval.” “You do not give an initial approval.” “I will prepare the budget proposal.”