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.

Slides:



Advertisements
Similar presentations
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)
Advertisements

Logic & Critical Reasoning
fitch rules for negation
Arguments for The Existence of God Ontological Cosmological Teleological Ontological Cosmological Teleological.
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Philosophy 103 Linguistics 103 Yet, still, Even further More and yet more, etc., ad infinitum, Introductory Logic: Critical Thinking Dr. Robert Barnard.
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
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
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.
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,
Alpha: Symbolization and Inference Bram van Heuveln Minds and Machines Lab RPI.
Chapter 3 Propositional Logic
derivations in Predicate Logic 15 points each, plus 10 free points 1.universal derivation[Exercise Set C] 2.existential-out[Exercise Set D] 3.negation.
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.
Introduction to Logic Logical Form: general rules
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
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.
WARM UP EXERCSE Consider the right triangle below with M the midpoint of the hypotenuse. Is MA = MC? Why or why not? MC B A 1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Chapter Six Sentential Logic Truth Trees. 1. The Sentential Logic Truth Tree Method People who developed the truth tree method: J. Hintikka— “model sets”
1 Section 1.1 A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed.
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”
Introduction to Philosophy Lecture 3 An introduction to Deductive arguments By David Kelsey.
Today’s Topics Review of Sample Test # 2 A Little Meta Logic.
Natural Deduction CS 270 Math Foundations of CS Jeremy Johnson.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
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 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.
Propositional Logic. Topics Propositional calculus Deductions and prove Logical equivalence Tautologies Satisfiability.
assumption procedures
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
Formal Proofs and Boolean Logic Chapter 6 Language, Proof and Logic.
Arguments for The Existence of God Ontological Cosmological Telelogical Ontological Cosmological Telelogical.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
Chapter 4: Derivations PHIL 121: Methods of Reasoning April 10, 2013 Instructor:Karin Howe Binghamton University.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
ARGUMENTS Chapter 15. INTRODUCTION All research projects require some argumentation An argument simply ‘combines’ existing facts to derive new facts,
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 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
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
{P} ⊦ Q if and only if {P} ╞ Q
Methods of Proof A mathematical theorem is usually of the form pq
Lecture 6 CS 1813 – Discrete Mathematics
Criticism Reductio ad Absurdum Dilemmas Counterexamples 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.
Chapter 5.1 Write Indirect Proofs
No new reading for Monday. Exam #2 is Wednesday.
CS 270 Math Foundations of CS
Review To check an argument with a tree:.
The Method of Deduction
Negation Rule Strategies
1. (H . S) > [ H > (C > W)]
Computer Security: Art and Science, 2nd Edition
Proof Strategies PHIL 122 Fall 2012 Karin Howe.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Copyright © Cengage Learning. All rights reserved.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Chapter 8 Natural Deduction
Introductory Logic PHI 120
3.5 Symbolic Arguments.
Presentation transcript:

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 Derivation (CD) Negation Derivation (  D) Direct Derivation (DD)

3  6 argument forms, 15 points each, plus 10 free points  Symbolic argument forms (no translations)  For each one, you will be asked to construct a derivation of the conclusion from the premises. rule sheet  The rule sheet will be provided. 1 problemfromSet D 2 problem fromSet E 2 problemsfromSet F 1 problemfromSet G (91-96)

4  ––––––  ––––––  DN     –––––––      –––––––  O O  ––––––     ––––––    I I  ––––––      ––––––  O O   ––––––  &    ––––––  &  &I &I –––––––   &  –––––––  &O &O

5  D   :  ID   As   :    CD   :    CD   As  :      DD  :  DD          

6 Assumption Rule (CD)   If one has a line of the form  :    then one is entitled to write down the formula  on the very next line, as an assumption. Assumption Rule (  D)   If one has a line of the form  :   then one is entitled to write down 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) 

7  :  ° ° °  DD In Direct Derivation (DD), one directly arrives at the very formula one is trying to show.

8  :     As  :  ° ° ° CD ??

9  :    As   :  ° °  DD DD

10 (1)P  QPr (2)  P  QPr (3)  : Q?? We are stuck!!  we haveP  Q  O so to apply  O we must findP or find  Q  we also have  P  Q  O so to apply  O we must find  P or find  Q 

11  :    As   :  ° °  IDID DD  D This is exactly parallel to  D, and is another version of the traditional mode of reasoning known as REDUCTIO AD ABSURDUM  :    As   :  ° °  DD DD

12 any Although ID can, in principle, be used on any formula, it is best used on two types of formulas. 1.atomic formulasP, Q, R, etc. 2.disjunctions    ID  D The difference between ID and  D is that  Dnegations  D applies only to negations, IDall formulas whereas ID applies (in principle) to all formulas; it is a generic rule, like direct-derivation.

13  :    As   :  ° °  IDID DD  is atomic (P,Q,R, etc.)

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

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

16  :     [    ]As   :  ° °  IDID DD

17          ––––––––––––––––––    

18 (8) (7) (6) (5) (4) (3) (2) (1) 6,7,  1,5, Q  Q 3,  P DD  :  As  (P  Q) ID  : P  Q Pr  P  Q OO II OO

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

20 (9) (8) (6) (5) 7, (11) (10) (7) (4) (3) (2) (1) 6,10,  8,9,  P &  Q  Q  P 1,5,  (P  Q)  (  P &  Q) OO  (P & Q) DD  :  As  [ (P & Q)  (  P &  Q)] ID  : (P & Q)  (  P &  Q) Pr (P  Q)  (P & Q) 3, OO II &I&I OO

21