HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

Similar documents
Homework 1. 10(b) A useful denial of the statement We will win the first game or the second one is We will lose the first two games.

Full file at

1.1 Language and Logic

(b) Exercise 3 of Section 1.6 (c) Theorem (d) The PMI, Section 2.4 (e) Theorem (0 Theorem (g) Theorem4.2.2

1.1 Language and Logic

Introduction to Sets and Logic (MATH 1190)

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

Section 1.3. Let I be a set. When I is used in the following context,

CSC Discrete Math I, Spring Propositional Logic

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Mat 243 Exam 1 Review

Propositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election.

Chapter 2: The Logic of Quantified Statements. January 22, 2010

Recall that the expression x > 3 is not a proposition. Why?

Chapter 1: Formal Logic

2 Truth Tables, Equivalences and the Contrapositive

Mathematical Reasoning (Part I) 1

Chapter 1, Section 1.1 Propositional Logic

Chapter 1 Elementary Logic

EECS 1028 M: Discrete Mathematics for Engineers

Introduction to Decision Sciences Lecture 2

Logic and Propositional Calculus

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

COT 2104 Homework Assignment 1 (Answers)

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies

Predicates and Quantifiers

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

CSE 20 DISCRETE MATH. Winter

Math.3336: Discrete Mathematics. Propositional Equivalences

ANS: If you are in Kwangju then you are in South Korea but not in Seoul.

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

Notes for Recitation 1

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

PROPOSITIONAL CALCULUS

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Introducing Proof 1. hsn.uk.net. Contents

Homework assignment 1: Solutions

III. Elementary Logic

Section L.1- Introduction to Logic

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Proofs. Joe Patten August 10, 2018

CSE 20 DISCRETE MATH. Fall

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

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

1. Propositions: Contrapositives and Converses

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

Definitions Chapter 1 Proof Technique (Pg.1): Proof (Pg.2): Statement (Pg.2): Conditional Statement/Implication (Pg3.): Hypothesis(Pg.

Prof. Girardi Exam 1 Math 300 MARK BOX

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Example 1: Identifying the Parts of a Conditional Statement

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

ECOM Discrete Mathematics

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

1 Propositional Logic

Compound Propositions

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

1 Predicates and Quantifiers

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

STRATEGIES OF PROBLEM SOLVING

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

MATHEMATICAL REASONING

Learning Goals of CS245 Logic and Computation

Discrete Structures of Computer Science Propositional Logic I

Section 1.2: Conditional Statements

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

software design & management Gachon University Chulyun Kim

Today s Topic: Propositional Logic

Basic Logic and Proof Techniques

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

1 Implication and induction

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

Math 3336: Discrete Mathematics Practice Problems for Exam I

Math 13, Spring 2013, Lecture B: Midterm

THE LOGIC OF QUANTIFIED STATEMENTS

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold

Chapter 1: The Logic of Compound Statements. January 7, 2008

PS10.3 Logical implications

HANDOUT AND SET THEORY. Ariyadi Wijaya

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

(3,1) Methods of Proof

Math 3320 Foundations of Mathematics

1. From Lewis Carroll: extract a pair of premises and finish the conclusion.

Math 55 Homework 2 solutions

Section 1.1 Propositions

Chapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures

Section 3.1 Statements, Negations, and Quantified Statements

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Intro to Logic and Proofs

Some Review Problems for Exam 1: Solutions

THE LOGIC OF COMPOUND STATEMENTS

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

More examples of mathematical. Lecture 4 ICOM 4075

EECS-1019c: Assignment #1

Transcription:

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis Problem 1 Make truth tables for the propositional forms (P Q) (P R) and (P Q) (R S). Solution: P Q R P Q P R (P Q) (P R) F F F F F F F F T F F F F T F F F F F T T F F F T F F F F F T F T F T T T T F T F T T T T T T T P Q R S S P Q R S (P Q) (R S) F F F F T F F F F F F T F F F F F F T F T F T T F F T T F F F F F T F F T F F F F T F T F F F F F T T F T F T T F T T T F F F F T F F F T F F F T F F T F F F F T F T F T F T T T F T T F F F F T T F F T T F T T T F T F T F T T T T F T T T T T T T T F T F T Problem 2 Which of the following pairs of propositional forms are equivalent? (a) (P Q), P Q (b) (P Q), ( P ) ( Q). 1

Solution: P Q P Q P Q (P Q) P Q F F F T T T T F T F T F T F T F F F T T F T T T F F F F The table shows that (P Q) and P Q are not equivalent propositional forms. P Q P Q P Q (P Q) P Q F F F T T T T F T T T F F F T F T F T F F T T T F F F F Hence (P Q) and ( P ) ( Q) are indeed equivalent propositional forms. Problem 3 If P, Q and R are true while S and T are false, which of the following are true? (a) (( P ) ( Q)) (( R) ( S)) (b) (( T ) P ) (T P ). Solution: P Q R S P Q R S P Q R S (( P ) ( Q)) (( R) ( S)) T T T F F F F T F T T Thus (( P ) ( Q)) (( R) ( S)) is true. T P T T P T P (( T ) P ) (T P ) F T T T F T Thus (( T ) P ) (T P ) is also true! Problem 4 Give a useful denial of the following statements: (a) We will win the first game or the second one. (b) n is even and n is not a multiple of 5. Solution: (a) We will win neither the first nor the second game. (b) n is odd or n is a multiple of 5. Problem 5 P, Q and R are propositional forms, P is equivalent to Q and Q is equivalent to R. Prove that Q is equivalent to P and that P Q is equivalent to Q R. 2

Solution: We have to show that P and Q have the same truth value under the assumption that P and Q have the same truth value. We have P is true iff P is false iff Q is false iff Q is true Thus, P and Q are equivalent. Similarly, adding the assumption that Q and R are equivalent, we get P Q is true iff P is true and Q is true iff Q is true and R is true iff Q R is true whence, P Q and Q R are equivalent provided that P and Q are equivalent and Q and R are equivalent. Problem 6 Determine whether each of the following is a tautology, a contradiction or neither. Prove your answers. (a) (P Q) (( P ) ( Q)) (b) (Q P ) (P R). Solution: (a) (P Q) (( P ) ( Q)) is neither a tautology nor a contradiction. To see this, note that the assignment of the value T to both P and Q results in (P Q) (( P ) ( Q)) being T, whereas the assignment of the value T to P and of the value F to Q results in (P Q) (( P ) ( Q)) being F. (b) (Q P ) (P R) is neither a tautology nor a contradiction either. To see this, note that setting all three of P, Q and R true results in (Q P ) (P R) being false, whereas, setting P false but Q and R true results in (Q P ) (P R) being true. Problem 7 Which of the following conditional sentences are true? (a) If a hexagon has six sides, then the moon is made of cheese. (b) If Euclid s birthday was April 2, then rectangles have 4 sides. (c) 1 + 1 = 2 is sufficient for 3 > 6 (d) Horses have 4 legs whenever September 15 falls on a Saturday. Solution: (a) T since (T F ) = T. (b) T since ( T ) = T. (c) F since (T F ) = F. (d) T since ( T ) = T. Problem 8 Which of the following are true? (a) 7 + 5 = 12 iff 1 + 1 = 2 (b) A parallelogram has three sides iff 27 is a prime (c) The Eiffel Tower is in Paris iff the chemical symbol for helium is H (d) 10 + 13 < 11 + 12 iff 13 12 < 11 10. 3

Solution: (a) T since (T T ) = T. (b) T since (F F ) = T. (c) F since (T F ) = F. (d) T since either both inequalities are true or both are false. Problem 9 Make truth tables for the propositional forms (P Q) (Q R) P R and [(Q S) (Q R)] [(P Q) (S R)]. Solution: P Q R P Q Q R (P Q) (Q R) P R (P Q) (Q R) P R F F F F F F F T F F T F F F T T F T F F F F F T F T T F T T T T T F F F F F T T T F T F F F T T T T F T F T T T T T T T T T T T Q S R P Q S Q R P Q S R (Q S) (Q R) (P Q) (S R) F F F F T T F F T T T F F F T T T T F T F T F F T F T T F T T T T F F T T T T T T T T T F T F F T T F T T T T F T F T T T T T T T T F T T F T T F T T T T F T T T T T T T T T T T F F F F F T F F F T T F F T F F T F F F T T F T F F T T T F T T T F T T F T T T F T T T T F F T F T T F T T T T F T T F T T F T T T T T F T T T T T T T T T T T T T T T T T T Problem 10 Show that the following pairs of statements are equivalent: (a) P (Q R) and (P R) Q 4

(b) (P Q) R and (P Q) R (c) P Q and ( P Q) ( Q P ). Solution: (a) P (Q R) is false iff P is true and Q R is false iff P is true and Q, R are false iff P, R are true and Q is false iff P R is true and Q is false iff (P R) Q is false (b) (c) (P Q) R is false iff P Q is true and R is false iff (P is false or Q is true) and R is false iff (P is true and Q is false) is false and R is false iff P Q is false and R is false iff (P Q) R is false P Q is true iff P Q is true and Q P is true iff (P is false or Q is true) and (Q is false or P is true) iff P Q is true and Q P is true iff ( P Q) ( Q P ) is true Problem 11 Give, if possible, an example of a true conditional sentence for which (a) the converse is false (b) the contrapositive is true. Solution: (a) If 1 > 2 then 1 + 1 = 2. (b) If a > b then a + c > b + c. Problem 12 Give, if possible, an example of a false conditional sentence for which (a) the converse is true (b) the contrapositive is true. Solution: (a) If 1 + 1 = 2, then 1 > 2. (b) This is not possible because the contrapositive is equivalent to the original sentence. Problem 13 Determine whether each of the following is a tautology, a contradiction or neither: (a) (P Q) ( P Q) ( P Q) (b) (P Q) Q P (c) [P (Q R)] [R (P Q)]. 5

Solution: (a) We show that the given formula is a contradiction by showing that ( P Q) ( P Q) is equivalent to (P Q). We have ( P Q) ( P Q) iff ( P Q) (P Q) iff (P Q) (Q P ) iff [(P Q) (Q P )] iff (P Q) (b) This formula is neither a tautology nor a contradiction. Note that the assignment of true to both P and Q results in the formula being true, whereas the assignment of false to P and true to Q results in the formula being false. (c) This formula is a tautology. To see this, we prove that no assignment results in its value being false. Suppose that such an assignment existed. Then under that assignment R (P Q) must be false. Therefore R must be true and P Q must be false. But this implies that R and P must both be true and Q must be false. But, then, under this assignment, P (Q R) is false, whence the whole sentence is true, contrary to assumption. Problem 14 Translate the following English sentences into symbolic sentences with quantifiers. The universe for each is given in parentheses. (a) No right triangle is isosceles. (All triangles) (b) All people are honest or no one is honest. (All people) (c) For every positive real number x, there is a unique real number y such that 2 y = x. (Real numbers) Solution: (a) ( x)(x is right andx is isosceles) (b) ( x)(x is honest) ( x)(x is honest) (c) ( x)(x > 0 (!y)(2 y = x)). Problem 15 Which of the following are true? The universe for each is given in parentheses. (a) ( x)(x + x x) (Real numbers) (b) ( x)(2x + 3 = 6x + 7) (Natural numbers) (c) ( x)(3(2 x) = 5 + 8(1 x)) (Real numbers) (d) ( x)(x 2 + 6x + 5 0) (Real numbers) Solution: (a) This is false. The real number x = 1 is, for instance, a counterexample. (b) This is also false since the only real number that satisfies this equation is x = 1 which is not a natural number. (c) This is true, since the real number 7 5 satisfies the given equation. (d) This is false. The real number x = 3 provides a counterexample. Problem 16 Give an English translation for each. The universe is given in parentheses. (a) ( x)(x is prime x 2 x is odd) (Natural numbers) 6

(b) ( x)(x 2 < 0) (Real numbers) (c) ( x)(x is odd x 2 is odd) (Natural numbers) Solution: (a) Every prime natural number different from 2 is odd. (b) The square of every real number is nonnegative. (c) The square of every odd natural number is also odd. Problem 17 Which of the following are true for the universe of all real numbers? (a) ( x)( y)(x + y = 0) (b) ( x)( y)(x 2 + y 2 = 1) (c) ( y)(!x)(x = y 2 ) (d) (!x)(!y)( w)(w 2 > x y) Solution: (a) This is not true, since, if we fix x, then only y = x satisfies x + y = 0. (b) This is also false, since, for all reals x and y, x 2 + y 2 0. (c) This is true since f(y) = y 2 is a function from the reals to the reals. (d) This is false, since (x, y) = (1, 2) and (x, y) = (3, 4) both satisfy ( w)(w 2 > x y). Problem 18 Give a proof of (!x)p (x) ( x)p (x). Then show that the converse of this conditional sentence is false. Solution: Suppose that (!x)p (x) is true. Then, there exists unique c in the universe, such that P (c) is true. Hence ( x)p (x) is also true, which proves the implication. To see that the converse is true consider the universe of real numbers and the sentence P (x) = x 2 4 = 0. Then ( x)p (x) is certainly true but (!x)p (x) is false, since both 2 and 2 satisfy the given equation. 7