Natural Deduction 1 Hurley, Logic 7.4.

Slides:



Advertisements
Similar presentations
INTRODUCTION TO SYMBOLIC LOGIC
Advertisements

EU Market Situation for Eggs Management Committee 29 August
EU Market Situation for Eggs Management Committee 19 September
Proofs using all 18 rules, from Hurley 9th ed. pp Q > (F > A) 2. R > (A > F) 3. Q ∙ R / F ≡ A (J ∙ R) > H 2. (R > H) > M 3. ~(P v.
1 Section 6.3 Formal Reasoning A formal proof (or derivation) is a sequence of wffs, where each wff is either a premise or the result of applying a proof.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Logic 3 Tautological Implications and Tautological Equivalences
Using Existential Graphs for Automated Theorem Proving
Existential Graphs and Davis-Putnam April 3, 2002 Bram van Heuveln Department of Cognitive Science.
No new reading for Wednesday. Exam #2 is Friday. Office hours today are cancelled. Rescheduled for tomorrow, 2-4 p.m. Talk today at 3:15 in HUM 1B50. Colin.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Discrete Mathematics and its Applications
Chapter 24: Some Logical Equivalences. Logically equivalent statement forms (p. 245) Two statements are logically equivalent if they are true or false.
Formal Logic.
Propositions and Truth Tables
1 Introduction to Abstract Mathematics The Logic of Compound Statements 2.1 and 2.2 Instructor: Hayk Melikya
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
7.4 Rules of Replacement II Trans, Impl, Equiv, Exp, Taut.
DeMorgan’s Rule DM ~(p v q) :: (~p. ~q)“neither…nor…” is the same as “not the one and not the other” ~( p. q) :: (~p v ~q) “not both…” is the same as “either.
Mathematical Structures for Computer Science Chapter 1.2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements when switching order of antecedent and consequent If the car starts, there’s gas in the tank.
Propositional Calculus – Methods of Proof Predicate Calculus Math Foundations of Computer Science.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Natural Deduction Proving Validity. The Basics of Deduction  Argument forms are instances of deduction (true premises guarantee the truth of the conclusion).
Chapter Five Conditional and Indirect Proofs. 1. Conditional Proofs A conditional proof is a proof in which we assume the truth of one of the premises.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
assumption procedures
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
CS2013 Mathematics for Computing Science Adam Wyner University of Aberdeen Computing Science Slides adapted from Michael P. Frank ' s course based on the.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
1 CS1502 Formal Methods in Computer Science Notes 15 Problem Sessions.
Quiz 5 1.5, 3.1 Methods of Proof.. Quiz 5: Th. May pm 1) Give 2 rules of inference and the tautologies on which they are based. 2) Explain.
The Logic of Boolean Connectives Chapter 4 Language, Proof and Logic.
1.(p  q) 2. (r  s) 3. p v r  q v s 4. (p  q)  (r  s) conj. 1,2 5. q v sC.D. 3,4.
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
Today’s Topics Argument forms and rules (review)
1 Section 7.3 Formal Proofs in Predicate Calculus All proof rules for propositional calculus extend to predicate calculus. Example. … k.  x p(x) P k+1.
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Theorems and Shortcuts Kareem Khalifa Department of Philosophy Middlebury College.
Formal logic The part of logic that deals with arguments with forms.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Lecture 1-2: Propositional Logic. Propositional Logic Deriving a logical conclusion by combining many propositions and using formal logic: hence, determining.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Natural Deduction: Using simple valid argument forms –as demonstrated by truth-tables—as rules of inference. A rule of inference is a rule stating that.
Methods of Proof A mathematical theorem is usually of the form pq
A v B ~ A B > C ~C B > (C . P) B / ~ B mt 1,2 / B ds 1,2
Multiplication Properties of Exponents
Double Negation p :: ~ ~p 1.A > ~ (B . C) 2. B . C ~ ~ ( H v K) ~ H
Equivalence and Syllogisms
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Deductive Reasoning: Propositional Logic
CS 270 Math Foundations of CS
Mathematical Structures for Computer Science Chapter 1
8.2 Using the Rule of Inference
The Method of Deduction
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Natural Deduction Hurley, Logic 7.1.
1. (H . S) > [ H > (C > W)]
Logical Truth To show a statement A is a logic truth (tautology) ...
Natural Deduction Hurley, Logic 7.2.
Philosophy 1100 Class #9 Title: Critical Reasoning
Natural Deduction Hurley, Logic 7.3.
EU market situation for Eggs and Poultry Man Com 16 May 2012
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements
EXP file structure.
Chapter 8 Natural Deduction
Presentation transcript:

Natural Deduction 1 Hurley, Logic 7.4

Our Replacement Rules 2 Transportation (Trans): Exportation (Exp): (p → q) :: (~q → ~p) Material Implication (Impl): (p → q) :: (~p v q) Material Equivalence (Equiv): (p Ξ q):: [(p → q) ● (q → p)] (p Ξ p):: [(p ● q) v (~p ● ~q)] Exportation (Exp): [(p ● q) → r)] :: [(p → (q → r)] Tautology (Taut): p :: (p v p) p :: (p ● p)

Practice Finding Proof Steps 3 Practice Finding Proof Steps ~A / A → B ~A v B 1, Add A → B 2, Impl

Practice Finding Proof Steps 4 Practice Finding Proof Steps F → G F v G / G ~~F v G 2, DN ~F → G 3, Impl ~F → ~~G 4, DN ~G → F 5, Trans ~G → G 1,6, HS ~~G v G 7, Impl G v G 8, DN G 9, Taut

Practice Finding Proof Steps 5 Practice Finding Proof Steps J → (K → L) / K → (J → L) (J ● K) → L 1, Exp (K ● J) → L 2, Com K → (J → L) 3, Exp

Practice Finding Proof Steps 6 Practice Finding Proof Steps M → N M → O / M → (N ● O) ~M v N 1, Impl ~M v O 2, Impl ( ~M v N) ● (~M v O) 4, Conj ~M v (N ● O) 5, Dist M → (N ● O) 6, Impl

Practice Finding Proof Steps 7 Practice Finding Proof Steps P → Q R → (S ● T) ~R → ~Q S → (T → P) / P Ξ R Q → R 3, Impl P → R 1,5, HS (S ● T) → P 4, Exp R → P 2,7, HS (P → R) ● (R → P) 6,8, Conj P Ξ R 9, Equiv

Practice Finding Proof Steps 8 Practice Finding Proof Steps ~S → K S → (R v M) / ~R → (~M → K) ~K → ~~S 1, Trans ~K → S 3, DN ~K → (R v M) 2,4, HS ~(R v M) → ~~K 5, Trans ~(R v M) → K 6, DN (~R ● ~M) → K 7, DM ~R → (~M → K) 8, Exp

Practice Finding Proof Steps 9 Practice Finding Proof Steps K → M L → M / (K v L) → M (K → M) ● (L → M) 1,2, Conj (~K v M) ● (L → M) 3, Impl (~K v M) ● (~L v M) 4, Impl (M v ~K) ● (~L v M) 5, Com (M v ~K) ● (M v ~L) 6, Com M v (~K ● ~L) 7, Dist M v ~(K v L) 8, DM ~M → ~(K v L) 9, Impl ~~(K v L) → ~~M 10, Trans (K v L) → M 11, DN

Practice Finding Proof Steps 10 Practice Finding Proof Steps (S ● K) → R K / S → R (K ● S) → R 1, Com K → (S → R) 3, Exp S → R 2,4, MP

Practice Finding Proof Steps 11 Practice Finding Proof Steps T → (F v F) ~(F ● F) / ~T ~F 2, Taut T → F 1, Taut ~T 3,4, MT

Practice Finding Proof Steps 12 Practice Finding Proof Steps G → E H → ~E / G → ~H ~~E → ~H 2, Trans E → ~H 3, DN G → ~H 1,4, HS

Practice Finding Proof Steps 13 Practice Finding Proof Steps S Ξ Q ~S / ~Q (S → Q) ● (Q → S) 1, Equiv (Q → S) ● (S → Q) 3, Com Q → S 4, Simp ~Q 2,5, MT

Practice Finding Proof Steps 14 Practice Finding Proof Steps ~N v P (N → P) → T / T N → P 1, Impl T 2,3, MP

Practice Finding Proof Steps 15 Practice Finding Proof Steps F → B B → (B → J) / F → J (B ● B) → J 2, Exp B → J 3, Taut F → J 1,4, HS

Practice Finding Proof Steps 16 Practice Finding Proof Steps (B → M) ● (D → M) B v D / M M v M 1,2, CD M 3, Taut

Practice Finding Proof Steps 17 Practice Finding Proof Steps Q → (F → A) R → (A → F) Q ● R / F Ξ A Q 3, Simp R ● Q 3, Com R 5, Simp F → A 1,4, MP A → F 2,6, MP (F → A) ● (A → F) 7,8, Conj F Ξ A 9, Equiv

Practice Finding Proof Steps 18 Practice Finding Proof Steps T → (~T v G) ~G / ~T T → (T → G) 1, Impl (T ● T) → G 3, Exp T → G 4, Taut ~T 2,5, MT

Practice Finding Proof Steps 19 Practice Finding Proof Steps (B → G) ● (F → N) ~(G ● N) / ~(B ● F) (~G → ~B) ● (F → N) 1, Trans (~G → ~B) ● (~N → ~F) 1, Trans ~G v ~N 2, DM ~B v ~F 4,5, CD ~(B ● F) 6, DM

Practice Finding Proof Steps 20 Practice Finding Proof Steps (J ● R) → H) (R → H) → M ~(P v ~J) / M ● ~P J → (R → H) 1, Exp J → M 2,4, HS ~P ● ~~J 3, DM ~~J ● ~P 6, Com J ● ~P 7, DN J 8, Simp M 5,9, MP ~P 6, Simp M ● ~P 10,11, Conj

Practice Finding Proof Steps 21 Practice Finding Proof Steps T / S > T T v ~S 1, Add ~S v T 2, Com S > T 3, Impl

Practice Finding Proof Steps 22 Practice Finding Proof Steps (I > E) > C C > ~C / I ~C v ~C 2, Impl ~C 4, Taut ~(I > E) 1,4, MT ~(~I v E) 5, Impl ~~I & ~E 6, DM ~~I 7, Simp I 8, DN