i.e. The conclusion to the following argument says If you had an A, then you d have a ~(B v Z).

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

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.

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

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

3.0. OBJECTIVES 3.1.INTRODUCTION

Section 1.1 Propositions

Introducing Proof 1. hsn.uk.net. Contents

PHIL012. SYMBOLIC LOGIC PROPOSITIONAL LOGIC DERIVATIONS

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

Manual of Logical Style (fresh version 2018)

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

1.1 Statements and Compound Statements

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

PHIL12A Section answers, 16 February 2011

Formal Logic. Critical Thinking

Manual of Logical Style

Propositional Logic. Chrysippos (3 rd Head of Stoic Academy). Main early logician. AKA Modern Logic AKA Symbolic Logic. AKA Boolean Logic.

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

8. Reductio ad absurdum

Single-Predicate Derivations

8. Reductio ad absurdum

Natural deduction for truth-functional logic

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

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Truth Tables for Arguments

Predicate Logic combines the distinctive features of syllogistic and propositional logic.

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

CS 124 Math Review Section January 29, 2018

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:

Solving with Absolute Value

Phil 2B03 (McMaster University Final Examination) Page 1 of 4

Logic and Truth Tables

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

Exam Question 10: Differential Equations. June 19, Applied Mathematics: Lecture 6. Brendan Williamson. Introduction.

Propositional Logic: Syntax

Announcements For Methods of Proof for Boolean Logic Proof by Contradiction. Outline. The Big Picture Where is Today? William Starr

Propositional Logic: Part II - Syntax & Proofs 0-0

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

STEP Support Programme. Hints and Partial Solutions for Assignment 1

Supplementary Logic Notes CSE 321 Winter 2009

CHAPTER 10: SYMBOLIC TRAILS AND FORMAL PROOFS OF VALIDITY, PART 2

Math 1 Variable Manipulation Part 5 Absolute Value & Inequalities

MI 4 Mathematical Induction Name. Mathematical Induction

Induction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2

Propositional Logic. CS 3234: Logic and Formal Systems. Martin Henz and Aquinas Hobor. August 26, Generated on Tuesday 31 August, 2010, 16:54

Mathematical induction

Mathmatics 239 solutions to Homework for Chapter 2

Philosophy 220. Truth-Functional Equivalence and Consistency

MITOCW watch?v=t6tqhnxy5wg

DERIVATIONS IN SENTENTIAL LOGIC

Arguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)

Predicate Logic. 1 Predicate Logic Symbolization

Test 6A. Chapter 6 Test A

CPSC 121: Models of Computation

Supplementary exercises in propositional logic

Partial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions.

Isomorphisms and Well-definedness

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

Logik für Informatiker Logic for computer scientists

Introduction to Isabelle/HOL

Unary negation: T F F T

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

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

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

The paradox of knowability, the knower, and the believer

What is proof? Lesson 1

Making Measurements. On a piece of scrap paper, write down an appropriate reading for the length of the blue rectangle shown below: (then continue )

Logik für Informatiker Proofs in propositional logic

Exp 08: Organic Molecules

PHIL12A Section answers, 28 Feb 2011

Four Basic Logical Connectives & Symbolization

Warm-Up Problem. Is the following true or false? 1/35

Topic 1: Propositional logic

BASIC NOTIONS. x + y = 1 3, 3x 5y + z = A + 3B,C + 2D, DC are not defined. A + C =

Proofs. Joe Patten August 10, 2018

Logic and Truth Tables

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

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

Introduction to Basic Proof Techniques Mathew A. Johnson

Section 8.3 Higher-Order Logic A logic is higher-order if it allows predicate names or function names to be quantified or to be arguments of a

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

Natural Deduction for Propositional Logic

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations

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

Intermediate Logic. Natural Deduction for TFL

4 Quantifiers and Quantified Arguments 4.1 Quantifiers

A Guide to Proof-Writing

THE LOGIC OF COMPOUND STATEMENTS

Situation 29: Trigonometric Identities

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

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

Logarithms and Exponentials

MATH CSE20 Homework 5 Due Monday November 4

Understanding Exponents Eric Rasmusen September 18, 2018

PHIL 422 Advanced Logic Inductive Proof

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

Logic, Sets, and Proofs

CS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016

Symbolising Quantified Arguments

Transcription:

7.5 Conditional Proof (CP): Conditional Proof is a different way to do proofs. Using CP will always get you a horseshoe statement, so the best time to use it is when your conclusion is either a horseshoe or triplebar. A Conditional statement is a horseshoe statement (p q). It says If you had a p, then you d have a q. i.e. The conclusion to the following argument says If you had an A, then you d have a ~(B v Z). We are going to test this conclusion by assuming we do have the A (assuming the p of the p q ), and seeing if we can get ~(B v Z) (which is the q ). Any time you make an assumption, to show that you re doing something different than the regular proof, you need to indent (tab in). 1. A ~B 2. A ~Z / A ~(B v Z) 3. A (Assumption for CP) 4. ~B 1,3 MP 5. ~Z 2,3 MP 6. ~B ~Z 4,5 conj. 7. ~(B v Z) 6 DM 8. A ~(B v Z) 3-7 CP (the whole indented area) Line 7 shows that by assuming the A (saying if we had A ), that we could then get the ~(B v Z). So leaving the indented area (tabbing out) automatically gives us the first line of the indented area (our assumption) horseshoed to the last line of the indented area (wherever we decide to step back out). If we had left the indented area after line 5, CP would give us A ~Z (because we would have proven that if we had an A, we could get a ~Z). CP always automatically gives you your assumption horseshoed to where you leave. In the next proof, notice that the main connective of the conclusion is a horseshoe, but also that the q of that statement is another horseshoe statement. So it is saying If you had a ~Z then if you had an M, then you d have ~O. We are going to make 2 assumptions for this proof, one right after the other, because we have more horseshoe statements after our first assumption. 1. (M K) Z 2. ~O v (K v Z) / ~Z (M ~O) 3. ~Z 4. M 5. ~(M K) 1,3 MT 6. ~M v ~K 5 DM 7. ~K 4,6 DS 8. ~K ~Z 3,7 conj.

9. ~(K v Z) 8 DM 10. ~O 2,9 DS 11. M ~O 4-10 CP 12. ~Z (M ~O) 3-11 CP Your first assumption is always the p or left side of the main connective horseshoe in the conclusion. Cover that up and look at what s left. If it s another horseshoe statement then assume the p or left side of that one. Keep doing that until you run out of horseshoe statements. Never assume the last statement since it s the one you re trying to find. i.e. If this were your conclusion, this is how you d make your assumptions: / (O J) {(A F) ((~K U) [~O (M Z)])} O J A F ~K U ~O M 1. ~Z R 2. Z ~(O ~T) / (R Z) (~T ~O) 3. R Z 4. ~T 5. ~Z Z 1,3 HS 6. Z v Z 5 Impl. 7. Z 6 taut. 8. ~(O ~T) 2,7 MP 9. ~O v T 8 DM 10. ~O 4,9 DS 11. ~T ~O 4-10 CP 12. (R Z) (~T ~O) 3-11 CP Normally I draw a line from line 4 down to line 10, and then another line from line 3 down to line 11 showing the two indented areas. (I couldn t figure out how to do that in the Word doc). I draw the line for the indented area for 2 reasons. One is to line things up neatly, but the second and most important reason is to remind yourself that once you LEAVE an indented area, every line in that indented area becomes off limits. Doing CP with the triplebar: When you have a triplebar ( ) statement as your conclusion, you ll want to do 2 separate CP s (not one within another). Equivalence your conclusion on scrap paper using the horseshoe/dots one. You are going to do a CP to each half of that statement.

If you have a triplebar statement as one of your premises, equiv it first before you make your assumption. If you don t, then you ll have to redo it again for the second half of your CP. 1. ~M O 2. (M K) v Y 3. (~M v B) Z / (~M Z) (O Y) 4. (~M O) (O ~M 1 equiv. 5. ~M O 4 simp. 6. O ~M 4 simp. 7. ~M Z 8. ~M 7 simp. 9. O 5,8 MP 10. ~M v ~K 8 Add 11. ~(M K) 10 DM 12. Y 2,11 DS 13. O Y 9,12 conj. 14. (~M Z) (O Y) 7-13 CP 15. O Y 16. O 15 simp. 17. ~M 6,16 MP 18. ~M v B 17 Add 19. Z 3,18 MP 20. ~M Z 17,19 conj. 21. (O Y) (~M Z) 15-20 CP 22. [(~M Z) (O Y)] [(O Y) (~M Z)] 14,21 conj 23. (~M Z) (O Y) 22 equiv. 7.6 Indirect Proof (IP): This is another different way to do proofs. IP can be used on any proof (although it s trickier than CP for triplebar conclusions). With IP the assumption you re going to make is always the OPPOSITE of the conclusion (by doing this, it s like you re rendering the proof invalid). Then you will break the statements down until you find a pair of contradictory statements (something and its opposite). The last line within the indented area will be the conjunction of the two opposites. This proves that your assumption lead to a logical impossibility (which is bad), therefore instead of your assumption, you will get the opposite of it (which if you assumed the opposite of your conclusion, will then be your conclusion.)

A note on opposites: Remember that the opposite of something is always ONE tilde on the outside of it. Here are some examples: B ~B B H ~(B H) ~Y ~W ~(~Y ~W) ~H v M ~(~H v M) ~[~U v (N A)] ~U v (N A) In each case, the ONLY difference between the 2 statements is that one of them has a (red) tilde on the outside of it. Otherwise they are exactly the same. 1. ~B (B v Y) 2. (Z v O) ~(Y v M) / B v ~Z 3. ~(B v ~Z) AIP (assumption for IP) 4. ~B Z 3 DM 5. ~B 4 simp. 6. Z 4 simp. 7. B v Y 1,5 MP 8. Y 5,7 DS 9. Z v O 6 add 10. ~(Y v M) 2,9 MP 11. ~Y ~M 10 DM 12. ~Y 11 simp. 13. Y ~Y 8,12 conj (the contradiction) 14. B v ~Z 3-13 IP (it gives the opposite of your assumption) IP will always give you the OPPOSITE of your assumption once you find a pair of contradictory statements. Unlike CP, you cannot leave the indented area whenever you want. The last line of the indented area must be the conjunction (with a dot) of the two opposites. 1. (T B) (Y O) 2. (~Z M) (O ~Y) / (M ~T) v (B Z) 3. ~[(M ~T) v (B Z)] AIP 4. ~(M ~T) ~(B Z) 3 DM 5. ~(M ~T) 4 simp. 6. ~(B Z) 4 simp. 7. ~(~M v ~T) 5 Impl. 8. M T 7 DM 9. M 8 simp. 10. T 8 simp. 11. ~(~B v Z) 6 Impl. 12. B ~Z 11 DM

13. B 12 simp. 14. ~Z 12 simp. 15. T B 10,13 conj. 16. Y O 1,15 MP 17. Y 16 simp. 18. O 16 simp. 19. ~Z M 9,14 conj. 20. O ~Y 2,19 MP 21. ~Y 18,20 MP 22. Y ~Y 17,21 conj. 23. (M ~T) v (B Z) 3-22 IP If you want, you can use both CP and IP in the same proof: Ex. 1. (M E) v (Z v ~A) 2. (T T) (K A) / ~M (K Z) 3. ~M 4. K 5. ~Z AIP (assume the opposite of what you want) 6. ~M v ~E 3 Add 7. ~(M E) 6 DM 8. Z v ~A 1,7 DS 9. ~A 5,8 DS 10. K ~A 4,9 conj. 11. ~(~K v A) 10 DM 12. ~(K A) 11 Impl. 13. ~(T T) 2,12 MT 14. ~(~T v T) 13 Impl. 15. T ~T 14 DM (the contradiction) 16. Z 5-15 IP (get opposite of your assumption) 17. K Z 4-16 CP 18. ~M (K Z) 3-17 CP