Natural Deduction Hurley, Logic 7.1.

Slides:



Advertisements
Similar presentations
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
Advertisements

The Foundations: Logic and Proofs
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Laws of , , and  Excluded middle law Contradiction law P   P  T P   P  F NameLaw Identity laws P  F  P P  T  P Domination laws P  T  T P.
TR1413: Discrete Mathematics For Computer Science Lecture 4: System L.
Discrete Mathematics and its Applications
Propositional Proofs 2.
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.
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).
From Truth Tables to Rules of Inference Using the first four Rules of Inference Modus Ponens, Modus Tollens, Hypothetical Syllogism and Disjunctive Syllogism.
Philosophy: Logic and Logical arguments
CS2013 Mathematics for Computing Science Adam Wyner University of Aberdeen Computing Science Slides adapted from Michael P. Frank ' s course based on the.
Syllogisms and Three Types of Hypothetical Syllogisms
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
Today’s Topics Argument forms and rules (review)
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.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
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 =
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Making Inferences with Propositions (Rules of Inference)
Deductive Reasoning Valid Arguments
Arguments with Quantified Statements
Lecture Notes 8 CS1502.
Lecture 1.4: Rules of Inference
Discrete Mathematics.
Formal Logic CSC 333.
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.
Demonstrating the validity of an argument using syllogisms.
Proof Techniques.
Rules of Inference Section 1.6.
Introduction to Symbolic Logic
6.1 Symbols and Translation
Methods for Evaluating Validity
A v B ~ A B > C ~C B > (C . P) B / ~ B mt 1,2 / B ds 1,2
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.
CS201: Data Structures and Discrete Mathematics I
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Deductive Reasoning: Propositional Logic
Natural deduction Gerhard Gentzen.
Hurley … Chapter 6.5 Indirect Truth Tables
CS 270 Math Foundations of CS
Logical Forms.
Natural Deduction 1 Hurley, Logic 7.4.
THE REST The rest of the rules are not all that useful
CS 220: Discrete Structures and their Applications
Back to “Serious” Topics…
Concise Guide to Critical Thinking
Inference Rules: Tautologies
The Method of Deduction
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Natural Deduction Hurley, Logic 7.2.
CSNB234 ARTIFICIAL INTELLIGENCE
Copyright © Cengage Learning. All rights reserved.
Lecture 1.4: Rules of Inference
Natural Deduction Hurley, Logic 7.3.
Modus ponens.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
Deductive vs Non-Deductive Arguments
The Foundations: Logic and Proofs
Chapter 8 Natural Deduction
Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction.
Rules of inference Section 1.5 Monday, December 02, 2019
Discrete Mathematics Tautology and Proofs
Presentation transcript:

Natural Deduction Hurley, Logic 7.1

Our First 4 Argument Forms Modus Ponens: p → q p _______ q Modus Tollens ~q ~p Hypothetical Syllogism: p → q q → r _______ p → r Disjunctive Syllogism p v q ~p q Remember that p, q, and r stand for any well-formed formula, no matter how complex. For instance, below is an example of disjunctive syllogism: ~(K v J) v ~B ~~(K v J) __________ ~B

Practice Finding Proof Steps 1. A → B 2. ~A → (C v D) 3. ~B 4. ~C / D 5. ~A 1,3 MT 6. C v D 2,5 MP 7. D 4,6 DS

Practice Finding Proof Steps F → G F v H ~G H → (G → I) / F → I ~ F 1,3 MT H 2,5 DS G → I 4,6 MP F → I 1,7 HS

Practice Finding Proof Steps ~J J v K K → L / L K 1,2 DS L 3,4 MP

Practice Finding Proof Steps T → U R → S / R → U S → U 1,2 HS R → U 3,4 HS

Practice Finding Proof Steps E → (K → L) (Example from Hurley 12th edition) F → (L → M) G v E ~G F / K → M L → M 2,5 MP E 3,4 DS K → L 1,7 MP K → M 6,8 HS

Practice Finding Proof Steps ~(A ● B) v [~(E ● F) → (C → D)] (Example from Hurley 11th edition) ~~(A ● B) ~(E ● F) D → G / C → G ~(E ● F) → (C → D) 1,2, DS C → D 3,5, MP C → G 4,6, HS

Practice Finding Proof Steps G → [~O → (G → D)] O v G ~O / D G 2,3, DS ~O → (G → D) 1,4, MP G → D 3,5, MP D 4,6, MP

Practice Finding Proof Steps ~M v (B v ~T) B → W ~~M ~W / ~T B v ~T 1,3, DS ~B 2,4, MT ~T 5,6, DS

Practice Finding Proof Steps (L Ξ N) → C (L Ξ N) v (P → ~E) ~E → C ~C / ~P ~~E 3,4, MT ~(L Ξ N) 1,4, MT P → ~E 2,6, DS ~P 5,7, MT