Proof Worksheet 2, Math 187 Fall 2017 (with solutions)

Similar documents
Manual of Logical Style (fresh version 2018)

Manual of Logical Style

Natural deduction for truth-functional logic

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

Proof strategies, or, a manual of logical style

In this chapter, we specify a deductive apparatus for PL.

Axiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:

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

For a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.

Propositional Logic. Fall () Propositional Logic Fall / 30

Practice Test III, Math 314, Spring 2016

Packet #1: Logic & Proofs. Applied Discrete Mathematics

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

Section 1.2: Propositional Logic

Logic, Sets, and Proofs

Proof Tactics, Strategies and Derived Rules. CS 270 Math Foundations of CS Jeremy Johnson

THE LOGIC OF COMPOUND STATEMENTS

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

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

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.

Propositional Logic. Spring Propositional Logic Spring / 32

PHIL012. SYMBOLIC LOGIC PROPOSITIONAL LOGIC DERIVATIONS

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

CS 512, Spring 2016, Handout 02 Natural Deduction, and Examples of Natural Deduction, in Propositional Logic

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

15414/614 Optional Lecture 1: Propositional Logic

(ÀB Ä (A Â C)) (A Ä ÀC) Á B. This is our sample argument. Formal Proofs

Collins' notes on Lemmon's Logic

CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/33

Chapter 1 Elementary Logic

Deductive Systems. Lecture - 3

Derivations, part 2. Let s dive in to some derivations that require the use of the last four rules:

CITS2211 Discrete Structures Proofs

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

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

A. Propositional Logic

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

PROPOSITIONAL CALCULUS

Do not start until you are given the green signal

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

A Little Deductive Logic

The Logic of Compound Statements cont.

PROBLEM SET 3: PROOF TECHNIQUES

PHI Propositional Logic Lecture 2. Truth Tables

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

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

1.1 Statements and Compound Statements

A Little Deductive Logic

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

Logical Form 5 Famous Valid Forms. Today s Lecture 1/26/10

CSC Discrete Math I, Spring Propositional Logic

Review The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Language of Propositional Logic

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

A Quick Lesson on Negation

03 Propositional Logic II

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Inference and Proofs (1.6 & 1.7)

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Notes on Inference and Deduction

DISCRETE MATH: LECTURE 3

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

Logic and Proofs. (A brief summary)

What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.

HANDOUT AND SET THEORY. Ariyadi Wijaya

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

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

CS250: Discrete Math for Computer Science. L6: CNF and Natural Deduction for PropCalc

Resolution (7A) Young Won Lim 4/21/18

Advanced Topics in LP and FP

Logic for Computer Science - Week 5 Natural Deduction

Section 1.1 Propositions

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

Analyzing Arguments with Truth Tables

CSE 20: Discrete Mathematics

Propositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

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

Formal (natural) deduction in propositional logic

Compound Propositions

Propositional Logics and their Algebraic Equivalents

Propositional Logic: Syntax

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011

MATH 22 INFERENCE & QUANTIFICATION. Lecture F: 9/18/2003

Intermediate Logic. Natural Deduction for TFL

1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Supplementary Logic Notes CSE 321 Winter 2009

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

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

MATH 1090 Problem Set #3 Solutions March York University

cis32-ai lecture # 18 mon-3-apr-2006

Logic for Computer Science - Week 4 Natural Deduction

CMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013

Section 1.3: Valid and Invalid Arguments

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte

3 The Semantics of the Propositional Calculus

Transcription:

Proof Worksheet 2, Math 187 Fall 2017 (with solutions) Dr. Holmes October 17, 2017 The instructions are the same as on the first worksheet, except you can use all the rules in the strategies handout. We now have rules involving disjunction (or) and rules combining disjunction and negation (or and not). You are most welcome to come to office hours to ask me about these. Due date extended to Friday the 6th (really I ought to have extended it to the 4th, but I said Friday and I ll leave it at Friday). 1. Prove (P Q) (Q P ). This looks like one of the problems on the previous set, but it doesn t go quite the same way; and notice that I m only having you prove the implication in one direction, so you don t have to repeat yourself. Remember the use of the rule of addition to make your conclusions look right in each case [that s a hint!]. Assume (1): P Q Comments: Prove this by cases using (1). Case 1: Assume (1a): P (2a): Q P addition 1a Case 2: Assume (1b): Q (2b): Q P addition 1b (3): Q P proof by cases 1, 1a-2a, 1b-2b. (4): main theorem, deduction 1-3 1

It s not the only way to do it. Assume (1): P Q Comments: To prove this, assume Q and deduce P (or vice versa). Assume(2): Q Goal: P (3): P disjunctive syllogism 2,1 (4): Q P, alternative elimination 2-3 (5): main theorem deduction 1-4 2

2. Prove ((P Q) (Q R)) (P R). Hint: set everything up using the rules of implication and conjunction, and you will have a goal P R to prove. Use the alternative elimination strategy: assume P and prove R as a new goal, or vice versa. Disjunctive syllogism can be your friend here. Comments: I break up the hypothesis into two. Assume (1): P Q Assume(2): Q R Goal: P R Assume (3): P Goal: R (4): Q disjunctive syllogism 3,1 (5): R disjunctive syllogism 2,4 (6): P R alternative elimination 3-5 (7): main theorem deduction 1-6 3

3. Verify the classical rule of constructive dilemma, which takes the form (typo fixed above) P Q P R Q S R S We set up the first few lines (just to show you how to verify a rule as opposed to a theorem: we give the premises as initial lines and argue to the conclusion as a goal): [I ll complete the solution starting with these lines] (1): P Q premise (2): P R premise (3): Q S premise Goal: R S Comments: I m using the alternative elimination approach: assume R and show that S has to follow. Assume (4): R Goal: S (5): P modus tollens 4,2 (6): Q disjunctive syllogism 5,1 (7): S modus ponens 6,3 (8): R S alternative elimination 4-7, which completes the verification of the rule. (the presentation just above was not afflicted with a typo: if you used it you were all right) Hint: there are two very different ways to do this. One works by proof by cases on line 1 and goes directly in each case (with use of the rule of addition to get the conclusions of the cases to line up). The other approach involves setting up the proof of R S by alternative elimination (assume R and argue to S as a goal, or vice versa), followed by applications of modus tollens and disjunctive syllogism. 4

If you can write both proofs, I might give a little extra credit. 4. Prove (A B) ( A B) (or you may prove the other de Morgan law if you prefer, or both for additional credit). Please note that you cannot use the de Morgan laws in this proof! I stole the solution from another of my texts which presented the problem with different letters. Theorem: (P Q) ( P Q) Proof: Part 1: Assume (1): (P Q) Goal: P Q We use the alternative elimination strategy: assume the negation of one alternative and show that the other alternative follows. Assume (2): P Goal: Q Assume (3): Q Goal: (a contradiction) Goal: P Q (in order to get a contradiction with line 1) 4 P double negation, line 3 5 P Q (lines 3 and 4) 6 1,5 contradiction. This resolves the goal at line 3. 7 Q lines 3-6 negation introduction. This resolves the goal at line 2. 8 P Q 2-7 disjunction introduction. This resolves the goal at line 1. 5

Part 2: Assume (9): P Q Goal: (P Q) Assume (10): P Q Goal: (a contradiction) We use the strategy of proof by cases on line 9. Case 1 (9a): P Goal: 11 : P from line 10 12 : 9a, 11 contradiction (this resolves the goal after 9a) Case 2 (9b): Q Goal: 13 Q from line 10 14 9b, 13 contradiction (this resolves the goal after 9b) 15 9, 9a-14 proof by cases. 16 (P Q) 9-15 negation introduction. This resolves the goal at line 9. 6