ANALYSIS EXERCISE 1 SOLUTIONS

Similar documents
CSC Discrete Math I, Spring Propositional Logic

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

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

Compound Propositions

AMTH140 Lecture 8. Symbolic Logic

PHI Propositional Logic Lecture 2. Truth Tables

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

1. Propositions: Contrapositives and Converses

Section 1.2: Propositional Logic

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

2.2: Logical Equivalence: The Laws of Logic

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

Logic Review Solutions

2 Truth Tables, Equivalences and the Contrapositive

Propositional Equivalence

PROBLEM SET 3: PROOF TECHNIQUES

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Solutions to Homework I (1.1)

PHIL12A Section answers, 28 Feb 2011

Propositional natural deduction

The Logic of Compound Statements cont.

Logic. Def. A Proposition is a statement that is either true or false.

A. Propositional Logic

Math 102 Section 08, Fall 2010 Solutions Practice for Formal Proofs of Arguments

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

DISCRETE MATH: LECTURE 3

Discrete Mathematics. Instructor: Sourav Chakraborty. Lecture 4: Propositional Logic and Predicate Lo

Section 3.1 Statements, Negations, and Quantified Statements

A statement is a sentence that is definitely either true or false but not both.

Part Two: The Basic Components of the SOFL Specification Language

PROPOSITIONAL CALCULUS

Proofs. Joe Patten August 10, 2018

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Section 1.1: Logical Form and Logical Equivalence

Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13

Math Assignment 2 Solutions - Spring Jaimos F Skriletz Provide definitions for the following:

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

COT 2104 Homework Assignment 1 (Answers)

Definition 2. Conjunction of p and q

Discrete Structures of Computer Science Propositional Logic I

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.

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

Unit 6 Logic Math 116

DEDUCTIVE REASONING Propositional Logic

Chapter 1 Elementary Logic

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

The statement calculus and logic


Boolean Logic. CS 231 Dianna Xu

Topic 1: Propositional logic

4 Quantifiers and Quantified Arguments 4.1 Quantifiers

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

Math.3336: Discrete Mathematics. Propositional Equivalences

CISC-102 Winter 2016 Lecture 17

1.1 Language and Logic

A Quick Lesson on Negation

8.8 Statement Forms and Material Equivalence

Propositional Logic. Fall () Propositional Logic Fall / 30

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

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

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

Mat 243 Exam 1 Review

Homework 3: Solutions

Supplementary exercises in propositional logic

a. ~p : if p is T, then ~p is F, and vice versa

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

1.3 Propositional Equivalences

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

1.1 Language and Logic

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions

Introduction to Decision Sciences Lecture 2

Homework 4 Solutions

CITS2211 Discrete Structures Proofs

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Equivalence and Implication

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Logic and Truth Tables

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

PS10.3 Logical implications

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

PL: Truth Trees. Handout Truth Trees: The Setup

Part 2 Module 2 The Conditional Statement. A conditional statement is a statement of the form "If p, then q,"

Solutions to Sample Problems for Midterm

Propositional Logic Introduction and Basics. 2.2 Conditional Statements. 2.3 Inferencing. mjarrar 2015

Propositional Logic. Spring Propositional Logic Spring / 32

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

15414/614 Optional Lecture 1: Propositional Logic

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

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

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Propositional Logic Resolution (6A) Young W. Lim 12/12/16

Logic: Propositional Logic (Part I)

Transcription:

ANALYSIS EXERCISE 1 SOLUTIONS 1. (a) Let B The main course will be beef. F The main course will be fish. P The vegetable will be peas. C The vegetable will be corn. The logical form of the argument is B F P C (F C) (B P ) The premises are B F, P C, (F C); the conclusion is (B P ). The argument is invalid. If B P is true, then the premises are true, but the conclusion is false. It might help to consider the possibilities (B P, etc.). (b) Let 2. (a) S Sales will go up. H The boss will be happy. E Expenses will go up. The logical form of the argument is (S H) (E H) (S E) The premise is (S H) (E H); the conclusion is (S E). The argument is invalid. Suppose S E H. Then the premise is valid and the conclusion false. P Q P + Q T T F T F T F T T F F F (b) (P Q) ( P Q). 3. ( P Q), for example. 4. (b), (c), (d). 5. (a) A B C C B C A (B C) T T T F T T T T F T T T T F T F F F T F F T T T F T T F T F F T F T T F F F T F F F F F F T T F 1

2 ANALYSIS EXERCISE 1 SOLUTIONS (b) A B A B A B A B (A B) ( A B) T T F F T F F T F F T T T T F T T F T T T F F T T F T F 6. (a) (b) (c) [(A B) (B C)] (A C). Let us prove that this is a law by constructing its truth table. (Denote by D the above propositional form.) A B C A B B C (A B) (B C) A C D T T T T T F T F F F T T F T F T F T T T F F F T F F T F T T F T F T F F T T F F T F F F [ C (A B)] [A (B C)]. Let us prove that this is a law by using some laws given in the lecture notes. First, rewrite in an equivalent form the antecedent (the left hand side) of the above implication. [ C (A B)] [C (A B)] [C ( A B)] [C A B]. Now let us simplify the right hand side. Now the result is clear. [A (B C)] [ A ( B C)] [C A B]. [(A B) ( A B)] (C B). (A B) is false only if A is true and B is false. ( A B) is false only if A is true (A is false) and B is false. Hence, [(A B) ( A B)] is false if B is false, and is true if B is true. But if B is true then (C B) is true, no matter what C is. Therefore [(A B) ( A B)] (C B) is always true. 7. No. Take F instead of A, T instead of B and F instead of C. 8. (a) If A is true then A B is also true. If A is false then A (A B) is also false. (b) If A is true then both A B and A B are true. If A is false then one of the A B and A B is also false. (c) The proof is given by means of constructing the truth table for the propositional form which is denoted by C below.

ANALYSIS EXERCISE 1 SOLUTIONS 3 A B A B A B A B (A B) C T T F F T F F T T F F T T F F T F T T F T F F T F F T T F T T T (d) Using (c) and the double negation law we have (A B) ( A B) ( A B) ( A B). 9. (a) (b) (c) (d) A B C B C A ( B C ) T T F F F T F T T T T F F T T F T T T T F T F T T F F T T T F F F T T A B C A C B ( A C ) T T F F F T F T T T T F F F T F T T T T F T F T T F F T T T F F F T T A B C A B A C (A B) (A C) T T T F T F F T F T F T F T F F F F F F F T F T T T F F T T T T F F F T T T A B C A B (A B) C T T F T F T F T F T T F F F T F T T F T F T F F T F F T F T F F F F T

4 ANALYSIS EXERCISE 1 SOLUTIONS (0.1) (0.2) (0.3) (0.4) (e) A B C B C A (B C) T T F F F T F T F F T F F F F F T T T T F T F F T F F T F T F F F F T Thus, (a),(b),(d) are equivalent, and (c),(e) are equivalent. 10. Let us introduce the following propositions (a) A { Smith was drunk}. (b) B { Johns is the murderer}. (c) C { Smith lies}. (d) D { the murder took place after midnight}. Then we know that A (B C) is true. B ( A D) is true. D (B C) is true. A C is true. From (0.2) we have that either B is true, in which case we are done, or A and D are true. Then, since D is true, by (0.3), B is true (done) or C is true. But C being true and A being true contradicts (0.4). (0.1) is not needed at all. Alternatively, if you had not spotted the above argument you could use the following truth table. In fact, this is a more general kind of argument that should always work with questions like this. A B C D B C A D A (B C) B ( A D) D (B C) A C F T T T T T T T F T F T T T T T T F T T F T T T T T T F F T F T T T T T F T T T F T F T T T F T F T F T F T T T F F T F F F F F T T F F F F F F F T T F T T T F F T T F T F T T T F F T F T T F T F F T F T T T T F F T T F F F T F T F T F T F F F F T F T T T F T F F F F F F T F T T Because of (0.1)-(0.4), we know that the propositions A (B C), B ( A D), D (B C) and A C are all true. This corresponds to lines 1-4 and 11-12 in the truth table. We notice that the truth value of B in all these lines is T. Hence, proposition B is true. (Notice that nothing can be deduced about propositions A, C, D, as on lines 1-4, 11-12 they have truth values both T and F.)

ANALYSIS EXERCISE 1 SOLUTIONS 5 11. (a) Assume the premises P Q and R Q. Assume P. Then Q (as P Q). The premise R Q is equivalent to Q R by the contrapositive law. So R is true. Thus P R is true. (b) Assume the premise R (P Q). Assume P. Also assume Q. By the logical law (A B) ( A B), the premise is equivalent to the disjunction R (P Q). Using the same logical law, P Q is equivalent to P Q. But this is false, as both P and Q are true. So R is true. But then Q R is true and P (Q R) is true. (There are other proofs, for example, proof by contradiction. But more on that later.) 12. A B = {3, 4}, A B = {0, 1, 2, 3, 4, 7, 10}, A B = {7, 10}, A B = {0, 1, 2, 7, 10}. 13. (x A (A B)) (x A) (x A B) (x A) (x A) (x B) (by De Morgan s law and the double negation law) (x A) [ (x A) (x B)] [(x A) (x A)] [(x A) (x B)] (x A) (x B) since (x A) (x A) is false. 14. Let us introduce the propositions P {x A}, Q {x B}, R {x C}. Then we can rewrite what has to be proved as which is a law. 15. Let us introduce the propositions [(P Q) (Q R)] (P R), P {x A}, Q {x B}. Then the first inclusion means that P (P Q) and the second one means that P Q P. Both are laws. 16. First, prove the equality A B = (A A B) B. Since A A B and B are disjoint, we have (0.5) N(A B) = N(A A B) + N(B). Notice that A = (A A B) (A B), where A A B and A B are disjoint. Therefore N(A) = N(A A B) + N(A B),

6 ANALYSIS EXERCISE 1 SOLUTIONS which combined with (0.5) gives the result.