The Method of Deduction

Slides:



Advertisements
Similar presentations
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Introduction to Theorem Proving
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
Logic Concepts Lecture Module 11.
CS128 – Discrete Mathematics for Computer Science
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.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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.
Introduction to Logic Logical Form: general rules
EE1J2 – Discrete Maths Lecture 4 Analysis of arguments Logical consequence Rules of deduction Rules of equivalence Formal proof of arguments See: Anderson,
Discrete Mathematics and its Applications
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.
Modus Ponens The following valid arguments show us how to apply the modus ponens (Rule of Detachment). a) 1) Lydia wins a ten-million-dollar lottery.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
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
CS2013 Mathematics for Computing Science Adam Wyner University of Aberdeen Computing Science Slides adapted from Michael P. Frank ' s course based on the.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.
Today’s Topics Argument forms and rules (review)
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
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.
Logic and Reasoning.
Arguments with Quantified Statements
2. The Logic of Compound Statements Summary
The Foundations: Logic and Proofs
Advanced Algorithms Analysis and Design
Discrete Mathematics Lecture 1 Logic of Compound Statements
Discrete Mathematics Logic.
Formal Logic CSC 333.
Thinking Mathematically
COMP 1380 Discrete Structures I Thompson Rivers University
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.
Proof Techniques.
Introduction to Symbolic Logic
6.1 Symbols and Translation
Methods for Evaluating Validity
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
Mathematical Reasoning
3.5 Symbolic Arguments.
Deductive Reasoning: Propositional Logic
Hurley … Chapter 6.5 Indirect Truth Tables
CS 270 Math Foundations of CS
Propositional Equivalences
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Inference Rules: Tautologies
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Computer Security: Art and Science, 2nd Edition
Discrete Mathematics Logic.
CSNB234 ARTIFICIAL INTELLIGENCE
Foundations of Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
Mathematical Reasoning
CS201: Data Structures and Discrete Mathematics I
Chapter 8 Natural Deduction
Presentation transcript:

The Method of Deduction Chapter 9 The Method of Deduction

Method of Deduction Though truth tables are adequate ways of testing very simple types of arguments, they quickly grow unwieldy as the number of component statements increases. However, by translating arguments into symbolism and using the method of deduction, even these arguments can easily be tested for validity.

Rules of Inference There are just nine rules of inference that logicians have deduced which can be used in constructing formal proofs: 1) Modus ponens 2) Modus tollens 3) Hypothetical syllogism 4) Disjunctive syllogism 5) Constructive dilemma 6) Absorption 7) Simplification 8) Conjunction 9) Addition Each of these rules of inference corresponds to valid elementary argument forms. By identifying these rules in steps of a proof, we can label the arguments as valid.

Rule of replacement Some obviously valid arguments cannot be proved valid using just the nine rules of inference. For many of these, the rule of replacement—which permits us to infer from any statement the result of replacing any component of the statement with any other logically equivalent component—can be helpful.

Logical Equivalences There are ten such logical equivalences: 1)De Morgan’s theorems 2) Commutation 3)Association 4) Distribution 5) Double negation 6)Transposition 7)Material implication 8) Material equivalence 9) Exportation 10) Tautology Whenever the formula for one is found in an argument, it can be replaced with its logically equivalent form to facilitate analysis.

Proving Invalidity Proving invalidity is more difficult and complex than proving validity, for simply failing to discover a formal proof of validity does not constitute a proof of invalidity. However, there is an effective method for proving invalidity, related to the truth table method— but shorter.

Proving Invalidity In essence, this method requires the construction of just one line of the truth table; and if in that line all the premises are true and the conclusion is false, then the argument is invalid. One can also construct an indirect proof of validity by stating an additional assumed premise that is the negation of the conclusion. If one can derive from this assumed premise and the original set of premises an explicit contradiction then the original argument must be invalid.

Paradox One strange and potentially confusing situation arises when inconsistent premises occur. If a set of premises is inconsistent, they will validly yield any conclusion at all—no matter how irrelevant. Of course, arguments that are valid because of inconsistent premises are unsound. This situation is related to the “paradox” of material implication.