Lab 2 - CA Chapter 1 Section 1.5

Slides:



Advertisements
Similar presentations
Rules of Inference Rosen 1.5.
Advertisements

Introduction to Proofs
Hypotheticals: The If/Then Form Hypothetical arguments are usually more obvious than categorical ones. A hypothetical argument has an “if/then” pattern.
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.
The Foundations: Logic and Proofs
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman.
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.
CS128 – Discrete Mathematics for Computer Science
TR1413: Discrete Mathematics For Computer Science Lecture 3: Formal approach to propositional logic.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Adapted from Discrete Math
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Discrete Mathematics and Its Applications
Introduction to Proofs
CS 103 Discrete Structures Lecture 07b
Discrete Mathematics CS 2610 August 24, Agenda Last class Introduction to predicates and quantifiers This class Nested quantifiers Proofs.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
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)
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
Lecture 1.2: Equivalences, and Predicate Logic* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph.
Discrete Structures – CS Text Discrete Mathematics and Its Applications Kenneth H. Rosen (7 th Edition) Chapter 1 The Foundations: Logic and Proofs.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Rules of Inference Dr. Yasir Ali.
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.
2.3 Methods of Proof.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 25.
Living Systems Chapter One: Studying Life 1.1 Measurements 1.2 Thinking Like a Scientist 1.3 Graphs.
If then Therefore It is rainingthe ground is wet It is raining the ground is wet.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
At this time I admit nothing that is not necessarily true. I am therefore precisely nothing but a thinking thing Descartes.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Uniqueness Quantifier ROI for Quantified Statement.
A is a knight:A A eats his hat:H. A is a knight:A A eats his hat:H If I am a knight then I’ll eat my hat: A  H.
Chapter 1 Propositional Logic
Chapter 8 Logic and Inference.
CSNB 143 Discrete Mathematical Structures
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
COMP 1380 Discrete Structures I Thompson Rivers University
Tutorial - Propositional Logic
The Foundations: Logic and Proofs
2 Chapter Introduction to Logic and Sets
CS201: Data Structures and Discrete Mathematics I
CS100: Discrete structures
CS201: Data Structures and Discrete Mathematics I
Discrete Math (2) Haiming Chen Associate Professor, PhD
Mathematics for Computer Science MIT 6.042J/18.062J
CS 220: Discrete Structures and their Applications
Discrete Mathematics Lecture # 8.
CSE 321 Discrete Structures
Discrete Mathematics Logic.
Information Technology Department SKN-SITS,Lonavala.
COMP 1380 Discrete Structures I Thompson Rivers University
CS201: Data Structures and Discrete Mathematics I
Logical and Rule-Based Reasoning Part I
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Presentation transcript:

Lab 2 - CA Chapter 1 Section 1.5 Book: Discrete Mathematics and Its Applications By Kenneth H. Rosen

Exercise (19- c), Page (74) Determine whether each of these arguments is valid. If an argument is correct, what rule of inference is being used? If it is not, what logical error occurs? c) if n is a real number with n > 2, then n2 > 4. Suppose that n ≤ 2. Then n2 ≤ 4.

Exercise (29), Page (74) Use rules of inference to show that , , and are true, then is true.

Exercise (24), Page (74) Identify the error or errors I this argument that supposedly shows that if is true then

Exercise (30), Page (74) Use resolution to show that the hypotheses “Allen is a bad boy or Hillary is a good girl” and “Allen is a good boy or David is happy” imply the conclusion “Hillary is a good girl or David is happy.”

What rule of inference is used in each of these arguments? Exercise (3- b), Page (72) What rule of inference is used in each of these arguments? b) Jerry is a mathematics major and a computer science major. Therefore, Jerry is a mathematics major.

Exercise (10- d), Page (73) For each of these sets of premises, what relevant conclusion or conclusions can be drawn? Explain the rules of inference used to obtain each conclusion from the premises. “Every student has an Internet account.” “Homer does not have a Internet account.” “Maggie has an Internet account.”

Exercise (14- a), Page (73) For each of these arguments, explain which rules of inferences are used for each step. a) “Linda, a student in this class, owns a red convertible. Everyone who owns a red convertible has gotten at least one speeding ticket. Therefore, someone in this class has gotten a speeding ticket.”

Exercise (15- c), Page (73) For each of these arguments, determine whether the argument is correct or incorrect and explain why. c) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird does not like fruit.

Exercise (35), Page (74) Determine whether this argument, taken from Kalish and Montague [KaM064], is valid. If superman were able and willing to prevent evil, he would do so. If Superman were unable to prevent evil, he would be impotent; if he were unwilling to prevent evil, he would be malevolent. Superman does not prevent evil. If Superman exists, he is neither impotent nor malevolent. Therefore, Superman does not exist.

Lab 2 - CB Chapter 1 Section 1.5 Book: Discrete Mathematics and Its Applications By Kenneth H. Rosen

Exercise (14- c), Page (73) For each of these arguments, explain which rules of inferences are used for each step. c) “All movies produced by John Sayles are wonderful. John Sayles produced a movie about coal miners. Therefore, there is a wonderful movie about coal miners.”

Exercise (16- b), Page (73) For each of these arguments, determine whether the argument is correct or incorrect and explain why. b) A convertible car is fun to drive. Isaac’s car is not convertible. Therefore, Isaac’s car is not fun to drive.

Exercise (28), Page (74) Use rules of inference to show that , are true, then is also true, where the domain of all quantifiers are the same.

Exercise (24), Page (74) Identify the error or errors I this argument that supposedly shows that if is true then

What rule of inference is used in each of these arguments? Exercise (3- e), Page (72) What rule of inference is used in each of these arguments? e) If I go swimming, then I will stay in the sun too long. If I stay in the sun too long, then I will sunburn. Therefore, if I go swimming, then I will sunburn.

Exercise (10- f), Page (73) For each of these sets of premises, what relevant conclusion or conclusions can be drawn? Explain the rules of inference used to obtain each conclusion from the premises. “I am either dreaming or hallucinating.” I am not dreaming.” “If I am hallucinating, I see elephants running down the road.”

Exercise (31), Page (74) Use resolution to show that the hypotheses “It is not raining or Yvette has her umbrella,” “Yvette does not have her umbrella or she does not get wet,” and “It is raining or Yvette does not get wet” imply that “Yvette does not get wet.”

Exercise (19- b), Page (74) Determine whether each of these arguments is valid. If an argument is correct, what rule of inference is being used? If it is not, what logical error occurs? b) if n is a real number with n > 3, then n2 > 9. Suppose that n2 ≤ 9. Then n≤ 4.

Exercise (34), Page (74) The Logic Problem, taken from WFF’N PROOF, The Game of Logic, has these two assumptions: “Logic is difficult or not many students like logic.” “If mathematics is easy, then logic is not difficult. By translating these assumptions into statements involving propositional variables and logical connectives, determine whether each of the following are valid conclusions of these assumptions: The mathematics is not easy, if many students like logic. That not many students like logic, if mathematics is not easy. That mathematics is not easy or logic is difficult. That logic is not difficult or mathematics is not easy. That if not many students like logic, then either mathematics is not easy or logic is not difficult.