Quiz 5 1.5, 3.1 Methods of Proof.. Quiz 5: Th. May 20 3.30-3.45 pm 1) Give 2 rules of inference and the tautologies on which they are based. 2) Explain.

Slides:



Advertisements
Similar presentations
Methods of Proof. Methods of Proof The Vicky Pollard Proof Technique Prove that when n is even n2 is even. Assume n is 0, then n2 is 0, and that is.
Advertisements

Introduction to Proofs
Announcements Grading policy No Quiz next week Midterm next week (Th. May 13). The correct answer to the quiz.
Quiz Methods of Proof..
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
08 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
Logic 3 Tautological Implications and Tautological Equivalences
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/01/11
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Determine whether each curve below is the graph of a function of x. Select all answers that are graphs of functions of x:
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Lecture , 3.1 Methods of Proof. Last time in 1.5 To prove theorems we use rules of inference such as: p, p  q, therefore, q NOT q, p  q, therefore.
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
1.5 Rules of Inference.
Methods of Proof & Proof Strategies
Introduction to Proofs
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
MATH 224 – Discrete Mathematics
Rules of Fractions Investigation. What do you understand from this statement? What can we say about this? What do we need to know first? What should we.
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
F22H1 Logic and Proof Week 6 Reasoning. How can we show that this is a tautology (section 11.2): The hard way: “logical calculation” The “easy” way: “reasoning”
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Discrete Structures (DS)
Section 2.21 Indirect Proof: Uses Laws of Logic to Prove Conditional Statements True or False.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
assumption procedures
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Chapter 1: The Foundations: Logic and Proofs
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
We will now study some special kinds of non-standard quantifiers. Definition 4. Let  (x),  (x) be two fixed formulae of a language L n such that x is.
2.3 Methods of Proof.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 25.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
Introduction to Proofs
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
Holt Geometry 5-5 Indirect Proof and Inequalities in One Triangle 5-5 Indirect Proof and Inequalities in One Triangle Holt Geometry.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Nature & Importance of Proofs In mathematics, a proof is: –a correct (well-reasoned, logically valid) and complete (clear, detailed) argument that rigorously.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Proof Techniques CS160/CS122 Rosen: 1.5, 1.6, 1.7.
DEFINING, REWRITING, AND EVALUATING RATIONAL EXPONENTS (1.1.1)
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Proof Techniques.
Methods of Proof A mathematical theorem is usually of the form pq
Indirect Argument: Contradiction and Contraposition
The Foundations: Logic and Proofs
Mathematical Reasoning
Set includes rational numbers and irrational numbers.
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
To Start: 10 Points Explain the difference between a Median of a triangle and an altitude of a triangle?
Mathematical Reasoning
Among the Hidden/Fahrenheit 451
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Quiz 5 1.5, 3.1 Methods of Proof.

Quiz 5: Th. May pm 1) Give 2 rules of inference and the tautologies on which they are based. 2) Explain what an indirect proof is and explain why it is a valid strategy to prove an implication of the form p  q. 3) What is a vacuous proof? (explain). 4) Determine whether the following arguments are valid: a) “If x^2 is irrational then x is irrational”, ” the number x=1/3 is not irrational”, “therefore: the number x^2=(1/3)^2 is not irrational”. b) “Joe’s coat fits in his bag” “Joe’s bag fits in his car” “Therefore: Joe fits in his car”.

Answers Quiz 5 1) Give 2 rules of inference and the tautologies on which they are based. - see book 2) Explain what an indirect proof is and explain why it is a valid strategy to prove an implication of the form p  q. - you prove the equivalent propsoition: (NOT q)  (NOT p) 3) What is a vacuous proof? (explain). - You prove p  q by showing that p is always false, i.e. F  q is always true. 4) Determine whether the following arguments are valid: a) “If x^2 is irrational then x is irrational”, ” the number x=1/3 is not irrational”, “therefore: the number x^2=(1/3)^2 is not irrational”. - yes valid: p  q AND (NOT q)  (NOT p). b) “Joe’s coat fits in his bag” “Joe’s bag fits in his car” “Therefore: Joe fits in his car”. -No not valid: one could conclude that Joe’s coat fits in his car, but not Joe itself.