Note: For #10 I have written out the solutions in more detail than you would be required to give.
|
|
- Catherine Sullivan
- 5 years ago
- Views:
Transcription
1 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.
2 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.
3 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
4 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.
5 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.
CSI30. Chapter 1. The Foundations: Logic and Proofs Rules of inference with quantifiers Logic and bit operations Specification consistency
Chapter 1. The Foundations: Logic and Proofs 1.13 Rules of inference with quantifiers Logic and bit operations Specification consistency 1.13 Rules of inference with quantifiers universal instantiation
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationQuantification. Using the suggested notation, symbolize the statements expressed by the following sentences.
Quantification In this and subsequent chapters, we will develop a more formal system of dealing with categorical statements, one that will be much more flexible than traditional logic, allow a deeper analysis
More informationSection 2.4: Arguments with Quantified Statements
Section 2.4: Arguments with Quantified Statements In this section, we shall generalize the ideas we developed in Section 1.3 to arguments which involve quantified statements. Most of the concepts we shall
More informationSolutions to Selected Exercises
Chapter 1 Solutions to Selected Exercises Section 1.1 2. {2, 4} 3. {7, 10} 5. {2, 3, 5, 6, 8, 9} 6. {1, 3, 5, 7, 9, 10} 8. A 9. 11. B 12. {1, 4} 14. {1} 15. {2, 3, 4, 5, 6, 7, 8, 9, 10} 18. 1 19. 3 22.
More informationPlease try all of the TRY THIS problems throughout this document. When done, do the following:
AP Computer Science Summer Assignment Dr. Rabadi-Room 1315 New Rochelle High School nrabadi@nredlearn.org One great resource for any course is YouTube. Please watch videos to help you with any of the summer
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.4 Arguments with Quantified Statements Copyright Cengage Learning. All rights reserved. Arguments
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More informationChapter 1.3 Quantifiers, Predicates, and Validity. Reading: 1.3 Next Class: 1.4. Motivation
Chapter 1.3 Quantifiers, Predicates, and Validity Reading: 1.3 Next Class: 1.4 1 Motivation Propositional logic allows to translate and prove certain arguments from natural language If John s wallet was
More informationHonors Geometry KEY Review Exercises for the December Exam
Honors Geometry KEY Review Exercises for the December Exam Here is a miscellany of exercises to help you prepare for the semester examination. You should also use your class notes, homework, quizzes, and
More informationPHIL 240, Introduction to Logic, Sections Fall 2011 FINAL EXAM 14 December Name (5 points): Section (5 points):
Section I True / False questions (2 points each) 1. TRUE Any argument that is sound is also valid. 2. FALSE_ If the premises of an argument are all true, then that argument is sound. 3. TRUE Every universal
More informationMath 6 Midterm Review Solutions
Math Midterm Review Solutions 1. a statement b not a statement truth or falsity depends on the reference for the pronoun she c statement d not a statement truth or falsity depends on the reference for
More informationWhat is the study of logic?
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition What is the study of logic? Logic is the study of making inferences given a set of facts, we attempt
More informationHonors Geometry KEY Review Exercises for the January Exam
Honors Geometry KEY Review Exercises for the January Exam Here is a miscellany of exercises to help you prepare for the semester examination. You should also use your class notes, homework, quizzes, and
More informationIII SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT. Multiple Choice Questions
III SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT Multiple Choice Questions MODULE - I 1. In Symbolic logic, do not change their value. a) Variables
More informationCSE Discrete Structures
CSE 2315 - Discrete Structures Lecture 5: Predicate Logic- Fall 2010 1 Motivation The use of predicates, variables, and quantifiers allows to represent a large number of arguments and expressions in formal
More informationSection 2.2: Introduction to the Logic of Quantified Statements
Section 2.2: Introduction to the Logic of Quantified Statements In this section, we shall continue to examine some of the fundamentals of predicate calculus. Specifically, we shall look at the negations
More informationNotes. Notes. Introduction. Notes. Propositional Functions. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.3 1.4 of Rosen cse235@cse.unl.edu Introduction
More informationIN A NUTSHELL : WHAT IS A VENN DIAGRAM?
For anyone who tries to Google anything today (August 4, 2014), you may notice that, according to Google, today is the 180 th birthday of the logician John Venn. Those who have taken a course in logic
More informationThomas Jefferson High School for Science and Technology Program of Studies TJ Math 1
Course Description: This course is designed for students who have successfully completed the standards for Honors Algebra I. Students will study geometric topics in depth, with a focus on building critical
More informationSECTION 1.5: LOGIC PROGRAMMING
SECTION 1.5: LOGIC PROGRAMMING William DeMeo williamdemeo@gmail.com University of South Carolina February 7, 2013 SPECIFYING FACTS AND RULES We populate our Prolog database with facts using predicates,
More informationGeometry Agenda. Week 1.5 Objective Grade. Deductive Reasoning Practice
Name Period Geometry Agenda Week 1.5 Objective Grade Monday September 19, 2016 Tuesday September 20, 2016 Wednesday September 21, 2016 Thursday September 22, 2016 Friday September 23, 2016 Deductive Reasoning
More informationPractical Questions CSCA48 Winter 2018 Week 3
Practical Questions CSCA48 Winter 2018 Week 3 Question #1 a) Implement the stack adt with the following conditions: i. use a list and must use the list method append() ii. use a list and must use the list
More informationHomework 1. Due Date: Wednesday 11/26/07 - at the beginning of the lecture
Homework 1 Due Date: Wednesday 11/26/07 - at the beginning of the lecture Problems marked with a [*] are a littlebit harder and count as extra credit. Note 1. For any of the given problems make sure that
More informationCS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010
CS 3512, Spring 2011 Instructor: Doug Dunham Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010 Prerequisites: Calc I, CS2511 Rough course outline:
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationToday s Lecture 4/13/ WFFs/ Free and Bound Variables 9.3 Proofs for Pred. Logic (4 new implicational rules)!
Today s Lecture 4/13/10 9.1 WFFs/ Free and Bound Variables 9.3 Proofs for Pred. Logic (4 new implicational rules)! Announcements Welcome Back! Answers to latest symbolizations HW are posted on-line Homework:
More informationHomework 1 CS 1050 A Due:
9-4-08 Homework 1 CS 1050 A Due: 9-11-08 Every assignment will be due at the beginning of class. Recall that you can collaborate in groups and/or use external references, but you must acknowledge the group/references
More informationPractice Midterm Exam Solutions
CS 470/670 Introduction to AI Spring 2016 Instructor: Marc Pomplun Practice Midterm Exam Solutions Duration: 75 minutes Question 1: out of points Question 2: out of points Question 3: out of points Question
More informationPractice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.
CSE 240, Fall, 2013 Homework 2 Due, Tuesday September 17. Can turn in class, at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Consider
More informationResolution (14A) Young W. Lim 6/14/14
Copyright (c) 2013-2014. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More informationPre-Calculus Calendar Chapter 1: Linear Relations and Functions Chapter 2: Systems of Linear Equations and Inequalities
Pre-Calculus Calendar Chapter : Linear Relations and Functions Chapter : Systems of Linear Equations and Inequalities /9 Monday Tuesday Wednesday Thursday Friday /0 / / /. p. 0: 9-5,, 5, 7-,, 5, 7-50.
More informationCPSC 121: Models of Computation. Module 5: Predicate Logic
CPSC 121: Models of Computation Module 5: Predicate Logic Module 5: Predicate Logic Midterm 1: Friday February 9 th, 17:00 to 18:15 A to C (by last name): room DMP 310 D to K: room MATH 100 L to P: room
More informationAlgebra 2 Honors Lesson 10 Translating Functions
Algebra 2 Honors Lesson 10 Translating Functions Objectives: The students will be able to translate a base function horizontally and vertically. Students will be able to describe the translation of f(x)
More informationPlease Excuse My Dear Aunt Sally
Instructional strategies - math Math Hierarchy - Order of Operations PEMDAS P E M/D A/S Parenthesis first Exponents, square roots Multiplication and Division (left to right) Addition and Subtraction (left
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 9 Normal Forms In the last class we have seen some consequences and some equivalences,
More informationGeometry Note-Sheet Overview
Geometry Note-Sheet Overview 1. Logic a. A mathematical sentence is a sentence that states a fact or contains a complete idea. Open sentence it is blue x+3 Contains variables Cannot assign a truth variable
More informationSubtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5.
Objective 1 Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5. -7-6 -5-4 -3-2 -1 0 1 2 3 4 5 6 7 Using the number line
More informationTopic A: Introduction to Prolog
Topic A: Introduction to Prolog Recommended Exercises and Readings From Programming in Prolog (5 th Ed.) Exercises: 1.2, 1.3, 1.4, Readings: Chapters 1 and 2 1 2 Prolog Prolog: Programming in Logic A logic
More informationThis is a function because no vertical line can be drawn so that it intersects the graph more than once.
Determine whether each relation is a function. Explain. 1. A function is a relation in which each element of the domain is paired with exactly one element of the range. So, this relation is a function.
More informationCSE 21 Spring 2016 Homework 5. Instructions
CSE 21 Spring 2016 Homework 5 Instructions Homework should be done in groups of one to three people. You are free to change group members at any time throughout the quarter. Problems should be solved together,
More informationCS112 Friday, September 12, 2008
CS112 Friday, September 12, 2008 Agenda Natural Deduction Questions FOL Translations FOL Interpretations Natural Deduction Questions? First Order Logic Translations Symbolization Key Universe of Discourse
More informationMATH 1131Q - Calculus 1.
MATH 1131Q - Calculus 1. Álvaro Lozano-Robledo Department of Mathematics University of Connecticut Day 2 Álvaro Lozano-Robledo (UConn) MATH 1131Q - Calculus 1 2 / 30 An Example: A Very Surprising Rate
More informationCS351, Mock Introduction Automata: The Methods and the Madness
CS351, Mock Introduction Automata: The Methods and the Madness What is this course about? Automata theory is the study of abstract computing devices, or machines. This topic goes back to the days before
More informationMath 55 - Spring 04 - Lecture notes # 1 - Jan 20 (Tuesday)
Math 55 - Spring 04 - Lecture notes # 1 - Jan 20 (Tuesday) Name, class, URL (www.cs.berkeley.edu/~demmel/ma55) on board Head TA Mike West speaks on bureaucracy Advertise CS 70 (T Th 2-3:30) as an "honors"
More information(d) If the moon shares nothing and the sun does not share our works, then the earth is alive with creeping men.
Math 15 - Spring 17 Chapters 1 and 2 Test Solutions 1. Consider the declaratives statements, P : The moon shares nothing. Q: It is the sun that shares our works. R: The earth is alive with creeping men.
More informationModule 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur
Module 6 Knowledge Representation and Logic (First Order Logic) Lesson 15 Inference in FOL - I 6.2.8 Resolution We have introduced the inference rule Modus Ponens. Now we introduce another inference rule
More informationAnnouncements Wednesday, August 23
Announcements Wednesday, August 23 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/teaching/f2017/m1553/index.html or on the website for this section:
More informationHomework: Study 6.1 # 1, 5, 7, 13, 25, 19; 3, 17, 27, 53
January, 7 Goals:. Remember that the area under a curve is the sum of the areas of an infinite number of rectangles. Understand the approach to finding the area between curves.. Be able to identify the
More informationAnnouncements Wednesday, August 22
Announcements Wednesday, August 22 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/18f/m1553/webpage/ or on the website for this section: http://people.math.gatech.edu/~jrabinoff/1819f-1553/
More informationUsing first order logic (Ch. 8-9)
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation
More informationTABLE OF CONTENTS. Worksheets Lesson 1 Worksheet Introduction to Geometry 41 Lesson 2 Worksheet Naming Plane and Solid Shapes.. 44
Acknowledgement: A+ TutorSoft would like to thank all the individuals who helped research, write, develop, edit, and launch our MATH Curriculum products. Countless weeks, years, and months have been devoted
More informationCS103 Spring 2018 Mathematical Vocabulary
CS103 Spring 2018 Mathematical Vocabulary You keep using that word. I do not think it means what you think it means. - Inigo Montoya, from The Princess Bride Consider the humble while loop in most programming
More informationSeventh Grade Spiraling Review Week 1 of First Six Weeks
Week of First Six Weeks Note: Record all work in your math journal. Day Indicate if each of the given numbers below is equivalent to, less than, or greater than. Justify each response. 0.0, 0 4.7, %,,
More informationAutomatic Reasoning (Section 8.3)
Automatic Reasoning (Section 8.3) Automatic Reasoning Can reasoning be automated? Yes, for some logics, including first-order logic. We could try to automate natural deduction, but there are many proof
More informationUsing first order logic (Ch. 8-9)
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation
More informationClass 8 - September 13 Indirect Truth Tables for Invalidity and Inconsistency ( 6.5)
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 8 - September 13 Indirect Truth Tables for Invalidity and
More informationCSE 21 Spring 2016 Homework 5. Instructions
CSE 21 Spring 2016 Homework 5 Instructions Homework should be done in groups of one to three people. You are free to change group members at any time throughout the quarter. Problems should be solved together,
More information2. How many subsets are there in D={3, 4, 7, 8, 11, 14, 15, 16, 22}? How many proper subsets?
Math 1332 Review for Exam 1 This review in and of itself does not prepare you for Exam 1. Make sure you have also done the suggested homework, online homework, and in-class quizzes. Exam 1: 2.1, 2.2, 2.3,
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing April 10, 2017 April 10, 2017 1 / 12 Announcements Don t forget, first homework is due on Wednesday. Each TA has their own drop-box. Please provide justification
More informationME5286 Robotics Spring 2014 Quiz 1 Solution. Total Points: 30
Page 1 of 7 ME5286 Robotics Spring 2014 Quiz 1 Solution Total Points: 30 (Note images from original quiz are not included to save paper/ space. Please see the original quiz for additional information and
More informationMAT137 Calculus! Lecture 31
MAT137 Calculus! Lecture 31 Today: Next: Integration Methods: Integration Methods: Trig. Functions (v. 9.10-9.12) Rational Functions Trig. Substitution (v. 9.13-9.15) (v. 9.16-9.17) Integration by Parts
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 PRINT Your Name:, (last) READ AND SIGN The Honor Code: As a member of the UC Berkeley community, I act with honesty,
More informationCS 251 Intermediate Programming Methods and More
CS 251 Intermediate Programming Methods and More Brooke Chenoweth University of New Mexico Spring 2018 Methods An operation that can be performed on an object Has return type and parameters Method with
More informationCampus Webmail CSU s Anti-Spam System and Webmail Management
Campus Webmail CSU s Anti-Spam System and Webmail Email Management Table of Contents CAMPUS WEBMAIL... 3 Block Mail From Sender... 3 Rules Overview... 4 Rules... 5 Prepare... 5 In the following example...
More informationCSU211 Exam 1 Fall 2007
CSU211 Exam 1 Fall 2007 Name: Student Id (last 4 digits): Instructor s Name: High School (State): Write down the answers in the space provided. You may use the usual primitives and expression forms, including
More informationMath CC 7: Shapes & Designs Inv. 2 Name: Per:
Math CC 7: Shapes & Designs Inv. 2 Name: Per: Day 1 Friday 10/27 Day 2 Monday 10/30 Day 3 Tuesday 10/31 Day 4 Wednesday 11/1 Day 5 Thursday 11/2 Day 6 Friday 11/3 SHAPES & DESIGNS-Inv. 2: DESIGNING POLYGONS:
More informationINTRODUCTION TO PROLOG
INTRODUCTION TO PROLOG PRINCIPLES OF PROGRAMMING LANGUAGES Norbert Zeh Winter 2018 Dalhousie University 1/44 STRUCTURE OF A PROLOG PROGRAM Where, declaratively, Haskell expresses a computation as a system
More informationECE Spring 2018 Problem Set #2 Due: 3/14/18
ECE 45234 - Spring 2018 Problem Set #2 Due: 3/14/18 The purpose of this problem set is to gain experience with logic-based methods. In the engineering design section you will be simulating the wumpus world.
More informationA Brief Introduction to Truth-Table Logic. Kent Slinker Pima Community College
` A Brief Introduction to ruth-able Logic Kent Slinker Pima Community College Earlier in this class, we learned that all arguments are either valid or invalid. Additionally, we learned that certain valid
More informationAugust 29, Quad2b FactoredForm Graphing.notebook
Quadratics 2b Quadratic Function: Graphing Factored Form Standards: F IF.4 & F IF.7 GLOs: #3 Complex Thinker Math Practice: Look for and make use of structure HW: WS #9 (graph on graph paper!) Learning
More informationProofs are Programs. Prof. Clarkson Fall Today s music: Proof by Paul Simon
Proofs are Programs Prof. Clarkson Fall 2017 Today s music: Proof by Paul Simon Review Previously in 3110: Functional programming in Coq Logic in Coq Today: A fundamental idea that goes by many names...
More informationDid you ever think that a four hundred year-old spider may be why we study linear relationships today?
Show Me: Determine if a Function is Linear M8221 Did you ever think that a four hundred year-old spider may be why we study linear relationships today? Supposedly, while lying in bed Rene Descartes noticed
More informationMath 21a Homework 22 Solutions Spring, 2014
Math 1a Homework Solutions Spring, 014 1. Based on Stewart 11.8 #6 ) Consider the function fx, y) = e xy, and the constraint x 3 + y 3 = 16. a) Use Lagrange multipliers to find the coordinates x, y) of
More informationAPPM/MATH Problem Set 4 Solutions
APPM/MATH 465 Problem Set 4 Solutions This assignment is due by 4pm on Wednesday, October 16th. You may either turn it in to me in class on Monday or in the box outside my office door (ECOT 35). Minimal
More informationMathWorks MATLAB download & installation instructions
MathWorks MATLAB download & installation instructions 1. Get the software from http://sts.fullerton.edu/software/matlab by clicking on the Get MATLAB Software link. Login with your CSUF Portal username
More informationCIS 194: Homework 8. Due Wednesday, 8 April. Propositional Logic. Implication
CIS 194: Homework 8 Due Wednesday, 8 April Propositional Logic In this section, you will prove some theorems in Propositional Logic, using the Haskell compiler to verify your proofs. The Curry-Howard isomorphism
More informationIntroduction to dependent types in Coq
October 24, 2008 basic use of the Coq system In Coq, you can play with simple values and functions. The basic command is called Check, to verify if an expression is well-formed and learn what is its type.
More information. As x gets really large, the last terms drops off and f(x) ½x
Pre-AP Algebra 2 Unit 8 -Lesson 3 End behavior of rational functions Objectives: Students will be able to: Determine end behavior by dividing and seeing what terms drop out as x Know that there will be
More informationMATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ).
MATH 139 W12 Review 1 Checklist 1 Exam Checklist 1. Introduction to Predicates and Quantified Statements (chapters 3.1-3.4). universal and existential statements truth set negations of universal and existential
More informationExample: NFA to DFA Conversion
CPSC 121 Lecture 36 April 8, 2009 Menu April 8, 2009 Topics: Example: NFA to DFA Conversion Final Reading List Summary The End! Reminders: On-line Quiz 12 deadline 5:00pm TODAY Teaching evaluation survey
More informationShopping Cart Appointments for Undergraduate Students
The University Registrar s Office is committed to providing the best service possible to our students. We always encourage feedback and take that into consideration when looking at our processes. We are
More informationTips from the experts: How to waste a lot of time on this assignment
Com S 227 Spring 2018 Assignment 1 80 points Due Date: Friday, February 2, 11:59 pm (midnight) Late deadline (25% penalty): Monday, February 5, 11:59 pm General information This assignment is to be done
More informationStrategies for Proofs
Strategies for Proofs Landscape with House and Ploughman Van Gogh Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 Goals of this lecture A bit more logic Reviewing Implication
More informationA calculator, scrap paper, and patty paper may be used. A compass and straightedge is required.
The Geometry and Honors Geometry Semester examination will have the following types of questions: Selected Response Student Produced Response (Grid-in) Short nswer calculator, scrap paper, and patty paper
More informationCommas. Review Mini Lesson
Commas Review Mini Lesson Why use a Comma? l A comma is a punctuation mark that helps keep distinct ideas separate. l Commas signal meaning, so it is critical to use them correctly! How do I use commas
More informationYear 10 Semester 1 Assessment Calendar
Weeks Date Subject Class Task Periods Term 1 Wk 2 Monday 2 February Tuesday 3 February SWIMMING CARNIVAL Wednesday 4 February Thursday 5 February Friday 6 February ENRICHMENT CAMP 7 & 8 Term 1 Wk 3 Monday
More informationFinal Exam Math 38 Graph Theory Spring 2017 Due on Friday, June 2, at 12:50 pm. Good Luck!!
Final Exam Math 38 Graph Theory Spring 2017 Due on Friday, June 2, at 12:50 pm NAME: Instructions: You can use the textbook (Doug West s Introduction to Graph Theory, without solutions), your notes from
More informationFirst Order Logic and Resolution
Artificial Intelligence CS 6364 Professor Dan Moldovan Section 6 First Order Logic and Resolution First Order Logic (First Order Predicate Calculus) n n There is need to access components of a sentence.
More informationCPSC 121 Midterm 2 Friday November 13th, 2015
CPSC 121 Midterm 2 Friday November 13th, 2015 [10] 1. For each of the following statements: Rewrite the statement using predicate logic. Write down ALL of the proof strategies (from the list given below),
More informationPresents: The Dirty Dozen. Workshop Series
Presents: The Dirty Dozen Workshop Series Workshop Two: Common Comma Rules One little punctuation mark, so many uses Why are commas so hard? Something seems wrong with this picture If you noticed the comma
More informationNeural Networks Lesson 9 - Fuzzy Logic
Neural Networks Lesson 9 - Prof. Michele Scarpiniti INFOCOM Dpt. - Sapienza University of Rome http://ispac.ing.uniroma1.it/scarpiniti/index.htm michele.scarpiniti@uniroma1.it Rome, 26 November 2009 M.
More information2. Solve for x when x < 22. Write your answer in interval notation. 3. Find the distance between the points ( 1, 5) and (4, 3).
Math 6 Practice Problems for Final. Find all real solutions x such that 7 3 x = 5 x 3.. Solve for x when 0 4 3x
More informationFUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC. Angel Garrido
Acta Universitatis Apulensis ISSN: 1582-5329 No. 22/2010 pp. 101-111 FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC Angel Garrido Abstract. In this paper, we analyze the more adequate tools to solve many
More informationTips from the experts: How to waste a lot of time on this assignment
Com S 227 Spring 2018 Assignment 1 100 points Due Date: Friday, September 14, 11:59 pm (midnight) Late deadline (25% penalty): Monday, September 17, 11:59 pm General information This assignment is to be
More informationGoing beyond propositional logic
Going beyond propositional logic Consider the following statements: p: Ling took CS245 q: Ling passed CS245 r: Ling failed CS245 Taken literally, these are all atomic statements, and formally they have
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationAdvanced Logical Thinking Skills (2)
Mei-Writing Academic Writing II(A) - Lecture 3 November 12, 2013 Advanced Logical Thinking Skills (2) A Logical Explanation of Causal Relation by Paul W. L. Lai Group Discussion: Think about your thesis
More informationArtificial Intelligence CSC 361
Artificial Intelligence CSC 361 Prof. Mohamed Batouche Computer Science Department CCIS King Saud University Riyadh, Saudi Arabia mbatouche@ccis.ksu.edu.sa Intelligent Systems Part I: Expert Systems Developing
More information