1 2 We demonstrate (show) that an argument is valid deriving by deriving (deducing) its conclusion from its premises using a few fundamental modes of.

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

Introduction to Proofs
Four Rules of Aristotelian Logic 1. Rule of Identity: A is A 2. Rule of Non-Contradiction: A is not (-A) 3. Rule of Excluded Middle: Either A or (-A)
fitch rules for negation
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
1. 2 Exam 1Sentential LogicTranslations (+) Exam 2Sentential LogicDerivations Exam 3Predicate LogicTranslations Exam 4Predicate LogicDerivations 6
CS128 – Discrete Mathematics for Computer Science
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
Logic 3 Tautological Implications and Tautological Equivalences
CSE (c) S. Tanimoto, 2008 Propositional Logic
Oh, a break! A logic puzzle   In a mythical (?) community, politicians always lie and non-politicians always tell the truth. A stranger meets 3 natives.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
1. 2  6 argument forms, 15 points each, plus 10 free points  Symbolic argument forms (no translations)  For each one, you will be asked to construct.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
TR1413: Discrete Mathematics For Computer Science Lecture 3: Formal approach to propositional logic.
1 2 We demonstrate (show) that an argument is valid deriving by deriving (deducing) its conclusion from its premises using a few fundamental modes of.
Copyright © Zeph Grunschlag,
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
1 2 3 We start with a few argument forms, which we presume are valid, and we use these to demonstrate that other argument forms are valid. We demonstrate.
1. 2 Day 14 Day 13 Day 12 Day 11 Day 10 Day 09 Introductory Material EXAM #2 show: conjunction Indirect Derivation show: atomic show: disjunction Conditional.
EE1J2 – Discrete Maths Lecture 4 Analysis of arguments Logical consequence Rules of deduction Rules of equivalence Formal proof of arguments See: Anderson,
Accelerated Math I Unit 2 Concept: Triangular Inequalities The Hinge Theorem.
Discrete Mathematics and its Applications
CSNB234 ARTIFICIAL INTELLIGENCE
Methods of Proof involving  Symbolic Logic February 19, 2001.
F22H1 Logic and Proof Week 6 Reasoning. How can we show that this is a tautology (section 11.2): The hard way: “logical calculation” The “easy” way: “reasoning”
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Introduction to Philosophy Lecture 5 The Ontological Argument By David Kelsey.
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
Introduction to Derivations in Sentential Logic PHIL 121: Methods of Reasoning April 8, 2013 Instructor:Karin Howe Binghamton University.
Hypothetical Derivations Kareem Khalifa Department of Philosophy Middlebury College.
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.
assumption procedures
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Introduction to Philosophy Lecture 5 The Ontological Argument By David Kelsey.
Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems and pg. 171.
Formal Proofs and Boolean Logic Chapter 6 Language, Proof and Logic.
Of 38 lecture 13: propositional logic – part II. of 38 propositional logic Gentzen system PROP_G design to be simple syntax and vocabulary the same as.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
2.3 Methods of Proof.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
Logic: The Language of Philosophy. What is Logic? Logic is the study of argumentation o In Philosophy, there are no right or wrong opinions, but there.
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)
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Chapter 7. Propositional and Predicate Logic
Challenges to the OAs The different versions of OA are challenged by:
IMPORTANT!! As one member of our class recognized, there is a major mistake on page 180 of the text where the rule schemas for SD are laid out. It symbolizes.
Propaganda and Logical Fallacies
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.
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
CS 270 Math Foundations of CS
Propositional Logic.
Review To check an argument with a tree:.
Computer Security: Art and Science, 2nd Edition
Elementary Number Theory & Proofs
Proof Strategies PHIL 122 Fall 2012 Karin Howe.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Chapter 7. Propositional and Predicate Logic
Copyright © Cengage Learning. All rights reserved.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Introductory Logic PHI 120
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

1

2 We demonstrate (show) that an argument is valid deriving by deriving (deducing) its conclusion from its premises using a few fundamental modes of reasoning.

3 available on course web page (on-line textbook) provided on exams keep this in front of you when doing homework don’t make up your own rules 

4

5  :  ° ° °  DD In Direct Derivation (DD), one directly arrives at the very formula one is trying to show. The Original and Fundamental  -Rule

6 (1)P  QPr (2)Q  RPr (3)  : P  R?? We are stuck!!   we haveP  Q  O so to apply  O we must findP or find  Q  we also haveQ  R  O so to apply  O we must findQ or find  R Arrow-Out Strategy

7  :     As  :  ° ° ° CD ?D Affiliated Assumption Rule if one has a line of the form  :    then one is entitled to write the formula  on the very next line, as an assumption. short for ‘assumption’ depends upon formula

8 (7) (6) (5) (4) (3) (2) (1) 2,6, R 1,4, Q DD  : R As P CD  : P  R Pr Q  R Pr P  Q OO OO

9 (8) (7) (6) (5) (4) (3) (2) (1) 2,7, R 4,6, P&Q 1,4, Q DD  : R As P CD  : P  R Pr (P&Q)  R Pr P  Q OO &I&I OO

10 (8) (9) (7) (6) (5) (4) (3) (2) (1) 3,5, Q 7,8, R 1,5, Q  R DD  : R As P CD  : P  R As P  Q CD  : (P  Q)  (P  R) Pr P  (Q  R) OO OO OO

11 (1)P  QPr (2)Q   PPr (3)  :  P?? We are stuck!!  we haveP  Q  O so to apply  O we must findP or find  Q  we also haveQ   P  O so to apply  O we must findQ or find  P  Arrow-Out Strategy

12  :    As   :  ° °  I DD DD short for ‘assumption’ special symbol for “absurdity” Historically, this method of reasoning is called REDUCTIO AD ABSURDUM (Latin for “reduction to absurdity”) self-contradiction assertingdenying In symbolic logic, an absurdity is a self-contradiction – both asserting and denying the same proposition. always done by DD see later for details

13 Assumption Rule If one has a line of the form  :   then one is entitled to write the formula  on the very next line, as an assumption. Contradiction-In (  I) if you have a formula  and you have its negation  then you are entitled to infer–––– a contradiction (absurdity) 

14 (8) (7) (6) (5) (4) (3) (2) (1) 4,7,  2,6,  P 1,4, Q DD  :  As P DD  :  P Pr Q   P Pr P  Q II OO OO

15 (8) (7) (6) (5) (4) (3) (2) (1) 6,7,  1,5, Q  Q 3, P DD  :  As P &  Q DD  :  (P &  Q) Pr P  Q II OO &O

16 (11) (8) (9) (10) (12) (7) (6) (5) (4) (3) (2) (1) 7,9,  R DD  :  1,5, Q   R 3,5, R 10,11,  As Q DD  :  Q As P CD  : P   Q As P  R CD  : (P  R)  (P   Q) Pr P  (Q   R) OO OO OO II

17 Not all absurdities are self-contradictions; some are just plain wacked.

18

19