CS2336 Discrete Mathematics

Similar documents
Math 55 Homework 2 solutions

Formal (Natural) Deduction for Predicate Calculus

MACM 101 Discrete Mathematics I. Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class)

2. Use quantifiers to express the associative law for multiplication of real numbers.

Denote John by j and Smith by s, is a bachelor by predicate letter B. The statements (1) and (2) may be written as B(j) and B(s).

Chapter 1 - Foundations

Chapter 2: The Logic of Quantified Statements

DISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PREDICATE LOGIC

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

4 Quantifiers and Quantified Arguments 4.1 Quantifiers

Propositional Logic Not Enough

Section Summary. Section 1.5 9/9/2014

Predicates, Quantifiers and Nested Quantifiers

1.3 Predicates and Quantifiers

Rules Build Arguments Rules Building Arguments

Math 3336: Discrete Mathematics Practice Problems for Exam I

Test 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:

STRATEGIES OF PROBLEM SOLVING

Mathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC

Solutions to Exercises (Sections )

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. March 1, :00 pm Duration: 1:15 hs

1 Predicates and Quantifiers

What does the word Proof mean to you A) Establishing a fact with complete certainty

Announcement. Homework 1

Intro to Logic and Proofs

Homework assignment 1: Solutions

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

Formal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

CSE Discrete Structures

Predicates and Quantifiers. CS 231 Dianna Xu

Discrete Mathematics and Its Applications

III. Elementary Logic

Discrete Structures for Computer Science

MAT2345 Discrete Math

CITS2211: Test One. Student Number: 1. Use a truth table to prove or disprove the following statement.

Predicate Logic. Andreas Klappenecker

Introduction to Sets and Logic (MATH 1190)

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

COMP 2600: Formal Methods for Software Engineeing

HOW TO USE A CHART Y N N N N N N Y Y N N N Y N N N Y Y N N. iv 2005 The Critical Thinking Co.

Chapter 3. The Logic of Quantified Statements

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

Logic Overview, I. and T T T T F F F T F F F F

CS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team

What is the story behind the picture?

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

Proving Arguments Valid in Predicate Calculus

Chapter 4, Logic using Propositional Calculus Handout

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

Section 1.3: Valid and Invalid Arguments

Section 2.1: Introduction to the Logic of Quantified Statements

Introduction. Predicates and Quantifiers. Discrete Mathematics Andrei Bulatov

Review: Potential stumbling blocks

Predicate Logic. Example. Statements in Predicate Logic. Some statements cannot be expressed in propositional logic, such as: Predicate Logic

CS 2336 Discrete Mathematics

For all For every For each For any There exists at least one There exists There is Some

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM Eng. Huda M.

Chapter 1: Inductive and Deductive Reasoning

At least one of us is a knave. What are A and B?

Lecture 3 : Predicates and Sets DRAFT

! Predicates! Variables! Quantifiers. ! Universal Quantifier! Existential Quantifier. ! Negating Quantifiers. ! De Morgan s Laws for Quantifiers

Mat2345 Week 2. Chap 1.5, 1.6. Fall Mat2345 Week 2. Chap 1.5, 1.6. Week2. Negation. 1.5 Inference. Modus Ponens. Modus Tollens. Rules.

CS0441 Discrete Structures Recitation 3. Xiang Xiao

COMP232 - Mathematics for Computer Science

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

Exercises. Exercise Sheet 1: Propositional Logic

Chapter 1 Elementary Logic

LOGIC. Name: Teacher: Pd: Page 1

Predicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )

Announcements CompSci 102 Discrete Math for Computer Science

Logic and Propositional Calculus

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

Discrete Structures Homework 1

PREDICATE LOGIC. Schaum's outline chapter 4 Rosen chapter 1. September 11, ioc.pdf

2/18/14. What is logic? Proposi0onal Logic. Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.

Rules of Inference. Arguments and Validity

Predicate Logic & Quantification

DISCRETE MATHEMATICS BA202

Mathematical Reasoning. The Foundation of Algorithmics

Quantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.

Full file at Chapter 1

Today s Lecture. ICS 6B Boolean Algebra & Logic. Predicates. Chapter 1: Section 1.3. Propositions. For Example. Socrates is Mortal

Quantifiers. P. Danziger

THE LOGIC OF COMPOUND STATEMENTS

Predicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59

Mat 243 Exam 1 Review

(Refer Slide Time: 02:20)

Skills Practice Skills Practice for Lesson 3.1

Transcription:

CS2336 Discrete Mathematics Homework 1 Tutorial: March 20, 2014 Problems marked with * will be explained in the tutorial. 1. Determine which of the following statements are propositions and which are non-propositions. If a statement is a proposition, then decide the truth value of it. (a) 2008 is a leap year. (b) All people living in Taiwan can speak in Taiwanese. (c) No parking. (d) What is a polite society? (e) George Lucas is not an Asian. (f) If I have seen further, it is by standing on the shoulders of giants. 2. (*) Consider the expression (P Q) (P Q). In any way that you like, find an equivalent expression that is as short as possible. Prove that your expression is equivalent. 3. (*) Let M be the proposition you will get all pass. Let P be the proposition you work hard. Express each of the following statements using M, P, and logical connectives. (a) You will get all pass if you work hard. (b) You did not work hard but you will get all pass. (c) You will get all pass whether or not you work hard. 4. Write down the negation of the following statements. (a) a > 0 or b > 0. (b) Both Newton and Gauss are mathematicians. (c) If a 2 + b 2 = 0, then a = b = 0. (d) All people prefer taking trains than buses. 5. Explain why the following statements are correct. (a) (P Q) ( P Q) is a tautology. (b) P (P Q) is logically equivalent to P. (c) P (Q R) and (P Q) R are not logically equivalent. (d) The negation of P (Q R) is logically equivalent to ( P ) ( Q) ( R). 6. Which of the following statements are logically equivalent to P ( Q)? Why? (a) ( P ) ( Q) 1

(b) ( P ) Q (c) ( P ) Q (d) (P Q) 7. Construct the truth tables step by step of the following propositions. (a) P ( Q Q) (b) (P Q) (P Q) (c) P (Q R) 8. (*) What is wrong with this argument? Let H(x) be x is happy. Given that xh(x), we conclude that H(Lola). Therefore Lola is happy. 9. (*) What is wrong with this argument? Let S(x, y) be x is shorter than y. Given the premise ss(s, Max) it follows that S(Max, Max). Then by existential generalization it follows that xs(x, x), so that someone is shorter than himself. 10. (*) 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 from (1). (3) P (c) Simplification from (2). (4) xp (x) Universal generalization from (3). (5) Q(c) Simplification from (2). (6) xq(x) Universal generalization from (5). (7) x(p (x) Q(x)) Conjunction from (4) and (6). 11. Show that the following arguments are valid. (a) Premises: A (B C), A Conclusion: B (b) Premises: E F, E G, F Conclusion: G (c) Premises: G F, H F, G Conclusion: H (d) Premises: N V, V Conclusion: N (e) Premises: U C, L U, L Conclusion: C (f) Premises: (A B) (C D), A C, B Conclusion: D (g) Premises: (H J) (I K), L, L (H I) Conclusion: J K (h) Premises: ( P Q) R, R (S T ), S U, U T Conclusion: P 2

12. Show that each of the following arguments is invalid by providing a counterexample. Find an assignment of truth values for given primitive statements P, Q, R, and S such that all premises are true while the conclusion is false. (a) Premises: (((P Q) R) ( Q R) Conclusion: P (b) Premises: P Q, Q R, R S, S Q Conclusion: S (c) (*) Premises: P, P R, P (Q R), Q S Conclusion: S 13. Show that the following arguments are valid. (a) Premises: xa(x) Conclusion: xa(x) (b) Premises: xa(x) Conclusion: x(a(x) B(x)) (c) Premises: x(a(x) B(x)), x(a(x) C(x)) Conclusion: x(c(x) B(x)) (d) Premises: x( K(x) H(x)) y(l(y) L(y)) Conclusion: x H(x) 14. (*) Let P (x), Q(x), and R(x) be the following open statements. P (x) : x 2 7x + 10 = 0 Q(x) : x 2 2x 3 = 0 R(x) : x < 0 (a) Determine the truth or falsity of the following statements, where the universe is all integers. If a statement is false, provide a counterexample or explanation. i. x(p (x) R(x)) ii. x(q(x) R(x)) iii. x(q(x) R(x)) iv. x(p (x) R(x)) (b) Find the answers to part (a) when the universe consists of all positive integers. (c) Find the answers to part (a) when the universe contains only the integers 2 and 5. 15. There are four boxes, A, B, C, and D. There are cakes in some of them. We know that If there are cakes in at least one of A and B, then D contains cakes. If there are cakes in at least one of A and C, then at least one of B and D do not contain cakes. If there are cakes in at least one of A and D, then B contains cakes, too. What can we say about A? (a) There must be cakes in it. 3

(b) There must be no cake in it. (c) We cannot conclude anything about A. 16. (*) Four students (A, B, C and D) attended an exam. The following are what they said after the exam. A: I got the highest score. B: I got the highest score. C: My score is lower than A s. D: B s score is higher than C s. Only the one who got the highest score tells the truth, the others are all liars. List the names of the students according to their scores from highest to lowest. (Note: All students have different scores.) 17. (*, Challenging) Jane, Janice, Jack, Jasper, and Jim are the names of five high schools chums. Their last names in one order or another are Carter, Carver, Clark, Clayton, and Cramer. Jasper s mother is dead. In deference to a certain very wealthy aunt, Mr. and Mrs. Clayton agreed when they were first married that if they ever had a daughter they would name her Janice. Jane s father and mother have never met Jack s parents. The Cramer and Carter children have been teammates on several of the school s athletic teams. When Cramer heard that Carver was going to be out of town on the night of the school s Father and Son banquet, Cramer called Mrs. Carver and offered to adopt her son for the evening, but Jack s father had already asked him to go. The Clarks and Carters, who are very good friends, were delighted when their children began dating each other. What is the full name of each youngster? You can make the following assumptions: If person A dates person B, then A and B are of opposite gender. There are no mixed gender sports. Agreements are always kept. No one got divorced. 18. (*, Challenging) Albert Einstein once posed a brain teaser that he predicted only 2% of the worlds population would be able to solve. FACTS: (a) There are 5 houses in 5 different colours (red, white, green, yellow, blue). (b) In each house lives a person with a different nationality (British, Swedish, Danish, German, Norwegian). 4

(c) These 5 owners drink a certain beverage (tea, coffee, milk, beer, water), smoke a certain brand of cigarette (Pall Mall, Dunhill, Blend, Camel, Marlborough), and keep a certain pet (dog, birds, cats, horses, fish). (d) No owners have the same pet, brand of cigaratte, or drink. CLUES: (a) The Brit lives in a red house. (b) The Swede keeps a dog. (c) The Dane drinks tea. (d) The green house is on the left of the white house. (e) The green house owner drinks coffee. (f) The person who smokes Pall Mall keeps birds. (g) The owner of the yellow house smokes Dunhill. (h) The man living in the house right in the center drinks milk. (i) The Norwegian lives in the first house. (j) The man who smokes Blend lives next to the one who keeps cats. (k) The man who keeps horses lives next to the man who smokes Dunhill. (l) The owner who smokes Camel drinks beer. (m) The German smokes Marlborough. (n) The Norwegian lives next to the blue house. (o) The man who smokes Blend has a neighbour who drinks water. The question is, who keeps the fish? HINT: Try working it out with pencil and paper as a matrix 5