Note: For #10 I have written out the solutions in more detail than you would be required to give.

Similar documents
CSI30. Chapter 1. The Foundations: Logic and Proofs Rules of inference with quantifiers Logic and bit operations Specification consistency

CSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi

Quantification. Using the suggested notation, symbolize the statements expressed by the following sentences.

Section 2.4: Arguments with Quantified Statements

Solutions to Selected Exercises

Please try all of the TRY THIS problems throughout this document. When done, do the following:

THE LOGIC OF QUANTIFIED STATEMENTS

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

Chapter 1.3 Quantifiers, Predicates, and Validity. Reading: 1.3 Next Class: 1.4. Motivation

Honors Geometry KEY Review Exercises for the December Exam

PHIL 240, Introduction to Logic, Sections Fall 2011 FINAL EXAM 14 December Name (5 points): Section (5 points):

Math 6 Midterm Review Solutions

What is the study of logic?

Honors Geometry KEY Review Exercises for the January Exam

III SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT. Multiple Choice Questions

CSE Discrete Structures

Section 2.2: Introduction to the Logic of Quantified Statements

Notes. Notes. Introduction. Notes. Propositional Functions. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.

IN A NUTSHELL : WHAT IS A VENN DIAGRAM?

Thomas Jefferson High School for Science and Technology Program of Studies TJ Math 1

SECTION 1.5: LOGIC PROGRAMMING

Geometry Agenda. Week 1.5 Objective Grade. Deductive Reasoning Practice

Practical Questions CSCA48 Winter 2018 Week 3

Homework 1. Due Date: Wednesday 11/26/07 - at the beginning of the lecture

CS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010

Summary of Course Coverage

Today s Lecture 4/13/ WFFs/ Free and Bound Variables 9.3 Proofs for Pred. Logic (4 new implicational rules)!

Homework 1 CS 1050 A Due:

Practice Midterm Exam Solutions

Practice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.

Resolution (14A) Young W. Lim 6/14/14

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics

Pre-Calculus Calendar Chapter 1: Linear Relations and Functions Chapter 2: Systems of Linear Equations and Inequalities

CPSC 121: Models of Computation. Module 5: Predicate Logic

Algebra 2 Honors Lesson 10 Translating Functions

Please Excuse My Dear Aunt Sally

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms

Geometry Note-Sheet Overview

Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5.

Topic A: Introduction to Prolog

This is a function because no vertical line can be drawn so that it intersects the graph more than once.

CSE 21 Spring 2016 Homework 5. Instructions

CS112 Friday, September 12, 2008

MATH 1131Q - Calculus 1.

CS351, Mock Introduction Automata: The Methods and the Madness

Math 55 - Spring 04 - Lecture notes # 1 - Jan 20 (Tuesday)

(d) If the moon shares nothing and the sun does not share our works, then the earth is alive with creeping men.

Module 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur

Announcements Wednesday, August 23

Homework: Study 6.1 # 1, 5, 7, 13, 25, 19; 3, 17, 27, 53

Announcements Wednesday, August 22

Using first order logic (Ch. 8-9)

TABLE OF CONTENTS. Worksheets Lesson 1 Worksheet Introduction to Geometry 41 Lesson 2 Worksheet Naming Plane and Solid Shapes.. 44

CS103 Spring 2018 Mathematical Vocabulary

Seventh Grade Spiraling Review Week 1 of First Six Weeks

Automatic Reasoning (Section 8.3)

Using first order logic (Ch. 8-9)

Class 8 - September 13 Indirect Truth Tables for Invalidity and Inconsistency ( 6.5)

CSE 21 Spring 2016 Homework 5. Instructions

2. How many subsets are there in D={3, 4, 7, 8, 11, 14, 15, 16, 22}? How many proper subsets?

Math 152: Applicable Mathematics and Computing

ME5286 Robotics Spring 2014 Quiz 1 Solution. Total Points: 30

MAT137 Calculus! Lecture 31

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1

CS 251 Intermediate Programming Methods and More

Campus Webmail CSU s Anti-Spam System and Webmail Management

CSU211 Exam 1 Fall 2007

Math CC 7: Shapes & Designs Inv. 2 Name: Per:

INTRODUCTION TO PROLOG

ECE Spring 2018 Problem Set #2 Due: 3/14/18

A Brief Introduction to Truth-Table Logic. Kent Slinker Pima Community College

August 29, Quad2b FactoredForm Graphing.notebook

Proofs are Programs. Prof. Clarkson Fall Today s music: Proof by Paul Simon

Did you ever think that a four hundred year-old spider may be why we study linear relationships today?

Math 21a Homework 22 Solutions Spring, 2014

APPM/MATH Problem Set 4 Solutions

MathWorks MATLAB download & installation instructions

CIS 194: Homework 8. Due Wednesday, 8 April. Propositional Logic. Implication

Introduction to dependent types in Coq

. As x gets really large, the last terms drops off and f(x) ½x

MATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ).

Example: NFA to DFA Conversion

Shopping Cart Appointments for Undergraduate Students

Tips from the experts: How to waste a lot of time on this assignment

Strategies for Proofs

A calculator, scrap paper, and patty paper may be used. A compass and straightedge is required.

Commas. Review Mini Lesson

Year 10 Semester 1 Assessment Calendar

Final Exam Math 38 Graph Theory Spring 2017 Due on Friday, June 2, at 12:50 pm. Good Luck!!

First Order Logic and Resolution

CPSC 121 Midterm 2 Friday November 13th, 2015

Presents: The Dirty Dozen. Workshop Series

Neural Networks Lesson 9 - Fuzzy Logic

2. Solve for x when x < 22. Write your answer in interval notation. 3. Find the distance between the points ( 1, 5) and (4, 3).

FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC. Angel Garrido

Tips from the experts: How to waste a lot of time on this assignment

Going beyond propositional logic

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Advanced Logical Thinking Skills (2)

Artificial Intelligence CSC 361

Transcription:

Math 218 Spring 2010 Homework 4 Solutions Section 1.5 Note: For #10 I have written out the solutions in more detail than you would be required to give. 10) 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. a) If I play hockey, then I am sore the next day. h s I use the whirlpool if I am sore. s w I did not use the whirlpool. w h: I play hockey. s: I am sore. w: I use the whirlpool. 1. w Premise 2. s w Premise 3. s Modus tollens from (1) and (2) I am not sore. 4. h s Premise 5. h w Hypothetical Syllogism from (2) and (4) If I play hockey, I use the whirlpool. 6. h Modus tollens from (3) and (4) OR from (1) and (5) I did not play hockey. b) If I work, it is either sunny or partly sunny. x(w (x) (S(x) P (x))) I worked last Monday or I worked last Friday. W (Monday) W (Friday) It was not sunny on Tuesday. S(Tuesday) It was not partly sunny on Friday. P (Friday) W (x): I work on x. S(x): It is sunny on x. P (x): It is partly sunny on x. Domain for all is {days of the week}. 1. W (Monday) W (Friday) Premise 2. W (x) (S(x) P (x)) Premise 3. P (Friday) Premise 4. W (Monday) (S(Monday) P (Monday)) Universal instantiation from (2) If I work Monday it is sunny or partly sunny on Monday.

5. W (Friday) (S(Friday) P (Friday)) Universal instantiation from (2) If I work Friday it is sunny or partly sunny on Friday. 6. W (Friday) S(Friday) Disjunctive syllogism from (3) and (5) If I work Friday it is sunny on Friday. 7. S(Monday) P (Monday) S(Friday) P (Friday) Modus ponens from (1), (4), and (6) It was either sunny or partly sunny on Monday or sunny on Friday. c) All insects have six legs. x[i(x) L(x)] Dragonflies are insects. x(d(x) I(x)) Spiders do not have six legs. x(s(x) L(x)) Spiders eat dragonflies. x((s(x) D(y) E(x, y)) I(x): x is an insect. D(x): x is a dragonfly. L(x): x has six legs. S(x): x is a spider. E(x, y): x eats y. Domain for all is {animals}. 1. x[i(x) L(x)] Premise 2. I(c) L(c) Universal instantiation from (1) If c is any insect then c has six legs. 3. x(d(x) I(x)) Premise 4. D(c) I(c) Universal instantiation from (3) (may use the same c since both are for all statements and c is arbitrary) If c is any dragonfly then c is an insect. 5. D(c) L(c) Hypothetical syllogism from (2) and (4) If c is any dragonfly then c has six legs. 6. x(d(x) L(x)) Universal generalization from (5) All dragonflies have six legs, or just Dragonflies have six legs. 7. x(s(x) L(x)) Premise 8. S(c) L(c) Universal instantiation from (7) If c is any spider then c does not have six legs. 9. L(c) I(c) Contrapositive of (2) If any c does not have six legs then c is not an insect. 10. S(c) I(c) Hypothetical syllogism from (8) and (9) If c is any spider then c is not an insect.

11. x(s(x) I(x)) Universal generalization from (10) All spiders are not insects, or just Spiders are not insects. d) Every student has an internet account. x(s(x) I(x)) Homer does not have an internet account. I(Homer) Maggie has an internet account. I(Maggie) S(x): x is a student. I(x): x has an internet account. Domain for both is {people}. 1. x(s(x) I(x)) Premise 2. S(Homer) I(Homer)) Universal instantiation from (1) If Homer is a student then Homer has an internet account. 3. I(Homer) Premise 4. S(Homer) Modus tollens from (2) and (3) Homer is not a student. Note: You may NOT conclude that Maggie is a student because that would be affirming the conclusion. The condition does not say that if you have an internet account you must be a student. e) All foods that are healthy to eat do not taste good. x(h(x) G(x)) Tofu is healthy to eat. H(tofu) You only eat what tastes good. x(e(x) G(x)) You do not eat tofu. E(tofu) Cheeseburgers are not healthy to eat. H(cheeseburger) H(x): x is healthy to eat. G(x): x tastes good. E(x): You eat x. Domain for all is {foods}. 1. x(h(x) G(x)) Premise 2. H(tofu) G(tofu) Universal instantiation from (1) 3. H(tofu) Premise 4. G(tofu) Modus ponens from (2) and (3) Tofu does not taste good. 5. x(e(x) G(x)) Premise

6. E(c) G(c) Universal instantiation from (5) If you eat any food c it tastes good and if any food c tastes good you eat it. 7. H(c) G(c) Universal instantiation from (1) Any food c that is healthy does not taste good. 8. E(c) G(c) Contrapositive of (6) 9. H(c) E(c) Hypothetical syllogism from (7) and (8) If any food c is healthy you don t eat it. 10. x(h(x) E(x)) Universal generalization from (9) You don t eat healthy foods. Note: Can also conclude that you don t eat tofu, but that is one of the premises anyway. Also, note H(cheeseburger) is a false hypothesis so no conclusions can be drawn (if a food is not healthy it may or may not taste good). f) I am either dreaming or hallucinating. d h I am not dreaming. d If I am hallucinating, I see elephants running down the road. h e d: I am dreaming. h: I am hallucinating. e: I see elephants running down the road. 1. d Premise 2. d h Premise 3. h Disjunctive syllogism I am hallucinating. 4. h e Premise 5. e Modus ponens from (3) and (4) I see elephants running down the road. 16) For each of these arguments determine whether the argument is correct or incorrect and explain why. a) Everyone enrolled in the university has lived in a dormitory. Mia has never lived in a dormitory. Therefore, Mia is not enrolled in the university. Correct: universal instantiation and modus tollens. b) A convertible car is fun to drive. Isaac s car is not a convertible. Therefore, Isaac s car is not fun to drive. Incorrect: denying the hypothesis is used.

c) Quincy likes all action movies. Quincy likes the movie Eight Men Out. Therefore, Eight Men Out is an action movie. Incorrect: affirming the conclusion is used. d) All lobstermen set at least a dozen traps. Hamilton is a lobsterman. Therefore, Hamilton sets at least a dozen traps. Correct: universal instantiation and modus ponens. 20) Determine whether these are valid arguments. a) If x is a positive real number, then x 2 is a positive real number. Therefore, if a 2 is positive, where a is a real number, then a is a positive real number. Incorrect: affirming the conclusion is used. b) If x 2 0, where x is a real number, then x 0. Let a be a real number with a 2 0; then a 0. Correct: modus ponens (and possibly universal instantiation). 24) Identify the error or errors in this argument that supposedly shows that if x(p (x) Q(x)) is true then xp (x) xq(x) is true. 1. x(p (x) Q(x)) Premise 2. P (c) Q(c) Universal instantiation 3. P (c) Simplification from (2) Error: Simplification is from an statement 4. xp (x) Universal generalization from (3) 5. Q(c) Simplification from (2) Error: Simplification is from an statement 6. xq(x) Universal generalization from (5) 7. x(p (x) xq(x)) Conjunction from (4) and (6) Error: Conjunction yields an statement Also, to apply universal generalization, it must be made clear that the c value that was generalized referred to any arbitrary c-value. Also, there is clearly an extra x in the last line that shouldn t be there but I actually think that may have been a typo.