Muhammad Arief download dari

Slides:



Advertisements
Similar presentations
Rules of Inference Rosen 1.5.
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Announcements Grading policy No Quiz next week Midterm next week (Th. May 13). The correct answer to the quiz.
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
The Foundations: Logic and Proofs
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
1 Valid and Invalid Arguments CS 202 Epp Section 1.3 Aaron Bloomfield.
Chapter 3. Mathematical Reasoning 3.1 Methods of proof A theorem is a statement that can be shown to be true. A proof is to demonstrate that a theorem.
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
Logic 3 Tautological Implications and Tautological Equivalences
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
1.5 Rules of Inference.
3.6 Analyzing Arguments with Truth Tables
Copyright © Curt Hill Rules of Inference What is a valid argument?
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
Propositional Proofs 2.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
CS 103 Discrete Structures Lecture 07b
Section 3.5 Symbolic Arguments
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Discrete Structures (DS)
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Discrete Mathematics. Predicates - the universal quantifier 11/28/2015 Suppose P(x) is a predicate on some universe of discourse. Ex. B(x) = “x is carrying.
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
LOGIC.
Rules of Inference Dr. Yasir Ali.
CSE 321 Discrete Structures Winter 2008 Lecture 5 Rules of Inference.
Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
Logic: The Language of Philosophy. What is Logic? Logic is the study of argumentation o In Philosophy, there are no right or wrong opinions, but there.
Proof Review CS 202 Aaron Bloomfield Spring 2007.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
CSci 2011 Discrete Mathematics Lecture 5 CSci 2011.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
CSE15 Discrete Mathematics 01/30/17
In this slide set… Rules of inference for propositions
Discrete Mathematics Logic.
Discrete Mathematics.
Chapter 1 Logic and Proofs Homework 1 Two merchants publish new marketing campaign to attract more customers. The first merchant launches a motto “Good.
Proof Techniques.
Rules of Inference Section 1.6.
Principles of Computing – UFCFA3-30-1
CS100: Discrete structures
Mathematical Reasoning
Section 3.5 Symbolic Arguments
3.5 Symbolic Arguments.
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Discrete Mathematics Logic.
Information Technology Department SKN-SITS,Lonavala.
Foundations of Discrete Mathematics
Valid and Invalid Arguments
Mathematical Reasoning
The Foundations: Logic and Proofs
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Discrete Mathematics Tautology and Proofs
Presentation transcript:

Muhammad Arief download dari http://arief.ismy.web.id Rules of Inference pg. 63 - 69 Muhammad Arief download dari http://arief.ismy.web.id http://arief.ismy.web.id

IF premise-1, ….., premise-n THEN conclusion Argument Definition An argument is a sequence of statements that ends with a conclusion. Valid mean that the conclusion must follow from the truth of the preceding statements or premises. IF premise-1, ….., premise-n THEN conclusion An argument is valid if and only if it is impossible for all the premises to be true and the conclusion to be false. If the premises are all true, then the conclusion is also true. Kita hanya memperhatikan dimana semua premises benar, jadi (kalau bisa) tidak perlu membuat truth table. http://arief.ismy.web.id

Example If you have a current password, then you can log onto the network You have a current password Therefore, You can log onto the network p  q p q The symbol , read “therefore” Construct the truth table http://arief.ismy.web.id

Argument If Socrates is a human being, then Socrates is mortal Therefore, Socrates is mortal p  q p q http://arief.ismy.web.id

Testing the Validity of an Argument Identify the premises and conclusion of the argument Construct a truth table showing the truth values of all the premises and the conclusion Find the rows (called critical rows) in which all the premises are true In each critical row, determine whether the conclusion of the argument is also true. If in each critical row the conclusion is also true, then the argument form is valid If there is at least one critical row in which the conclusion is false, the argument form is invalid http://arief.ismy.web.id

Valid or Invalid Argument ? p  ( q  r) ~r p  q http://arief.ismy.web.id

Valid or Invalid Argument ? p  q  ~r q  p Ù r p  r http://arief.ismy.web.id

Modus Ponens p  q p  q Modus ponens: method of affirming http://arief.ismy.web.id

Construct the truth table Modus Tolens p  q ~q  ~p Construct the truth table Modus tolens: method of denying http://arief.ismy.web.id

Basic Rules of Inference http://arief.ismy.web.id

Example It is below freezing now Therefore, It is either below freezing or raining now p p  q Valid argument : addition rule http://arief.ismy.web.id

Example It is below freezing and raining now Therefore, It is below freezing now p Ù q p Valid argument : simplification rule http://arief.ismy.web.id

Example If it rains today, then we will not have a barbecue today If we do not have a barbecue today, then we will have a barbecue tomorrow Therefore, If it rains today, then we will have a barbecue tomorrow http://arief.ismy.web.id

Example If it rains today, then we will not have a barbecue today If we do not have a barbecue today, then we will have a barbecue tomorrow Therefore, If it rains today, then we will have a barbecue tomorrow p  q q  r  p  r Valid argument : hypothetical syllogism http://arief.ismy.web.id

Rule of Inference and Arguments To show whether an argument is valid, when there are many premises in an argument: Construct truth table (not efficient) Use several rules of inference http://arief.ismy.web.id

Example It is not sunny this afternoon and it is colder than yesterday. We will go swimming only if it is sunny If we do not go swimming, then we will take a canoe trip If we take a canoe trip, then we will be home by sunset Conclusion: We will be home by sunset http://arief.ismy.web.id

Example It is not sunny this afternoon and it is colder than yesterday. We will go swimming only if it is sunny If we do not go swimming, then we will take a canoe trip If we take a canoe trip, then we will be home by sunset Conclusion: We will be home by sunset http://arief.ismy.web.id

Solution p: it is sunny this afternoon q: it is colder than yesterday. r: we will go swimming s: we will take a canoe trip t: we will be home by sunset http://arief.ismy.web.id

Solution ~p Ù q r  p ~r  s s  t Conclusion: t ? http://arief.ismy.web.id

Solution ~p Ù q ~p Simplication r  p ~r Modus tollens ~r  s s Modus ponens s  t t Modus ponens http://arief.ismy.web.id

Example If you send me an e-mail message, then I will finish writing the program If you do not send me an e-mail message, then I will go to sleep early If I go to sleep early, then I will wake up feeling refreshed Conclusion: If I do not finish writing the program, then I will wake up feeling refreshed. http://arief.ismy.web.id

Solution p: you send me an e-mail message q: I will finish writing the program r: I will go to sleep early s: I will wake up feeling refreshed http://arief.ismy.web.id

Solution p  q ~p  r r  s Conclusion: ~q  s? http://arief.ismy.web.id

Solution p  q ~q  ~p Contrapositive ~p  r ~q  r Hypothetical syllogism r  s ~q  s Hypothetical syllogism The contrapositive of p  q is ~q  ~p A conditional statement is logically equivalent to its contrapositive. http://arief.ismy.web.id

((p  q) Ù (~ p  r))  (q  r) Resolution Used to automate the task of reasoning and proving theorems. ((p  q) Ù (~ p  r))  (q  r) It is a tautology. Construct the truth table, if you don’t believe it. http://arief.ismy.web.id

((p  q) Ù (~ p  r))  (q  r) Example Jasmine is skiing or it is not snowing. It is snowing or Bart is playing hockey. Conclusion: Jasmine is skiing or Bart is playing hockey. p: it is snowing q: Jasmine is skiing r: Bart is playing hockey ((p  q) Ù (~ p  r))  (q  r) http://arief.ismy.web.id

Solve this problem If George does not have eight legs, then he is not an insect. George is an insect. Therefore George has eight legs. http://arief.ismy.web.id

Solve this problem Rudy works hard. If Rudy works hard, then he is a dull boy. If Rudy is a dull boy, then he will not get the job. Conclusion: Rudy will not get the job http://arief.ismy.web.id

Solve this problem If it does not rain or it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on. If the sailing race is held, then the trophy will be awarded. The trophy was not awarded Conclusion: It rained http://arief.ismy.web.id