Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 4) If.
Advertisements

Logic Use mathematical deduction to derive new knowledge.
Introductory Logic PHI 120 Presentation: "Intro to Formal Logic" Please turn off all cell phones!
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.
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
CSE (c) S. Tanimoto, 2008 Propositional Logic
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.
Reading: Chapter 4, section 4 Nongraded Homework: Problems at the end of section 4. Graded Homework #4 is due at the beginning of class on Friday. You.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
No new reading for Monday or Wednesday Exam #2 is next Friday, and we’ll review and work on proofs on Monday and Wed.
Methods of Proof involving  Symbolic Logic February 19, 2001.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Introductory Logic PHI 120 Presentation: “Basic Concepts Review "
Today’s Topics Review of Sample Test # 2 A Little Meta Logic.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
Natural Deduction Proving Validity. The Basics of Deduction  Argument forms are instances of deduction (true premises guarantee the truth of the conclusion).
Introductory Logic PHI 120 Presentation: "Natural Deduction – Introduction“ Bring this book to lecture.
HOW TO CRITIQUE AN ARGUMENT
Basic Inference Rules Kareem Khalifa Department of Philosophy Middlebury College.
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
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.
Natural Deduction System for First Order Logic Student: Wei Lei Instructor: W. M. Farmer Department of Computing and Software McMaster University, Hamilton,
assumption procedures
CS6133 Software Specification and Verification
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.
Writing a paragraph.
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 25.
MATHEMATICAL REASONING MATHEMATICAL REASONING. STATEMENT A SENTENCE EITHER TRUE OR FALSE BUT NOT BOTH A SENTENCE EITHER TRUE OR FALSE BUT NOT BOTH.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"
Today’s Topics Argument forms and rules (review)
More Proofs. REVIEW The Rule of Assumption: A Assumption is the easiest rule to learn. It says at any stage in the derivation, we may write down any.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Simple Logic.
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
AND.
Truth Tables for Negation, Conjunction, and Disjunction
{P} ⊦ Q if and only if {P} ╞ Q
For Friday, read Chapter 4, section 4.
Lecture 6 CS 1813 – Discrete Mathematics
Introductory Logic PHI 120
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.
Natural Deduction.
Midterm Discussion.
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
Introductory Logic PHI 120
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Introductory Logic PHI 120
For Wednesday, read Chapter 4, section 3 (pp )
Introductory Logic PHI 120
Chapter 8 Natural Deduction
Propositional Logic 5) And Copyright 2008, Scott Gray.
Introducing Natural Deduction
Introductory Logic PHI 120
More Derived Rules.
Subderivations.
Chapter 5: Indirect Rules
Presentation transcript:

Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture

Homework Memorize the primitive rules, except ->I and RAA Ex (according to these directions) For Each Sequent, answer these two questions: 1.What is the conclusion? 2.How is the conclusion embedded in the premises?

Homework I Memorize the primitive rules – Capable of writing the annotation m vI – Cite how many premises make up each rule one premise rule – Cite what kind of premises make up each rule can be any kind of wff (i.e., one of the disjuncts) – Cite what sort of conclusion may be derived a disjunction See The Rules HandoutThe Rules Except ->I and RAA

Homework I Memorize the primitive rules – Capable of writing the annotation m vI – Cite how many premises make up each rule one premise rule – Cite what kind of premises make up each rule can be any kind of wff (i.e., one of the disjuncts) – Cite what sort of conclusion may be derived a disjunction See The Rules HandoutThe Rules Except ->I and RAA

Content of Today’s Lesson 1.Proof Solving Strategy 2.The Rules 3.Doing Proofs 1.Proof Solving Strategy 2.The Rules 3.Doing Proofs

Expect a Learning Curve with this New Material Homework is imperative Study these presentations

SOLVING PROOFS “Natural Deduction”

Key Lesson Today (1) Read Conclusion (2) Find Conclusion in Premises P -> Q, Q -> R ⊢ P -> R Valid Argument: True Premises Guarantee a True Conclusion Valid Argument: True Premises Guarantee a True Conclusion

Ex My Directions Conclusion (1) What is the conclusion? Conclusion in Premises (2.a) Is the conclusion as a whole embedded in any premise? If yes, where? Else… (2.b) Where are the parts that make up the conclusion embedded in the premise(s)? S1 – S10 2) How is the conclusion embedded in the premises? Homework II

Conclusion in Premises Example: S16 P -> Q, Q -> R ⊢ P -> R

Conclusion in Premises Example: S16 P -> Q, Q -> R ⊢ P -> R C 1.Conclusion:  a conditional statement 2.Conclusion in the premises:  The conditional is not embedded in any premise  Its antecedent “P” is the antecedent of the first premise.  Its consequent “R” is the consequent of the second premise.

SOLVING PROOFS “Natural Deduction”

Proofs Rule based system – 10 “primitive” rules Aim of Proofs – To derive conclusions on basis of given premises using the primitive rules See page 17 – “proof”

What is a Primitive Rule of Proof? Primitive Rules are Basic Argument Forms – simple valid argument forms Rule Structure – One conclusion – Premises Some rules employ one premise Some rules employ two premises Φ&Ψ ⊢ Φ m &E Ampersand-Elimination Given a sentence that is a conjunction, conclude either conjunct m &E Ampersand-Elimination Given a sentence that is a conjunction, conclude either conjunct m,n &I Ampersand-Introduction Given two sentences, conclude a conjunction of them. m,n &I Ampersand-Introduction Given two sentences, conclude a conjunction of them. Φ,Ψ ⊢ Φ&Ψ

Catch-22 You have to memorize the rules! 1.To memorize the rules, you need to practice doing proofs. 2.To practice proofs, you need to have the rules memorized A Solution of Sorts "Rules to Memorize" on The Rules handoutThe Rules

&E ampersand elimination vE wedge elimination ->E arrow elimination E double-arrow elimination &I ampersand introduction vI wedge introduction ->I arrow introduction I double-arrow introduction EliminationIntroduction

THE TEN “PRIMITIVE” RULES Proofs Elimination Rules (break a premise)Introduction Rules (make a conclusion) * &E (ampersand Elimination) * &I (ampersand Introduction) * vE (wedge Elimination) * vI (wedge Introduction) * ->E (arrow Elimination) * ->I (arrow Introduction) * E (double arrow Elimination) * I (double arrow Introduction) A (Rule of Assumption) RAA (Reductio ad absurdum)

The 10 Rules Rules of Derivation 1 rule of "assumption": A 4 "elimination" rules: &E, vE, ->E, E 4 "introduction" rules: &I, vI, ->I, I 1 more rule: “RAA” (reductio ad absurdum) = 10 rules

The 10 Rules Rules of Derivation 1 rule of "assumption": A 4 "elimination" rules: &E, vE, ->E, E 4 "introduction" rules: &I, vI, ->I, I 1 more rule: “RAA” (reductio ad absurdum) = 10 rules

Proofs: 1 st Rule The most basic rule: Rule of Assumption a)Every proof begins with assumptions (i.e., basic premises) b)You may assume any WFF at any point in a proof Assumption Number the line number on which the “A” occurs. Assumption Number the line number on which the “A” occurs.

The 10 Rules Rules of Derivation 1 rule of "assumption": A 4 "elimination" rules: &E, vE, ->E, E 4 "introduction" rules: &I, vI, ->I, I 1 more rule: “RAA” (reductio ad absurdum) = 10 rules

The 10 Rules Rules of Derivation 1 rule of "assumption": A 4 "elimination" rules: &E, vE, ->E, E 4 "introduction" rules: &I, vI, ->I, I 1 more rule: “RAA” (reductio ad absurdum) = 10 rules

Proofs: 2 nd – 9 th Rules – Elimination Rules – break premises – Introduction Rules – make conclusions &I, vI, ->I, I &E, vE, ->E, E

The 10 Rules Rules of Derivation 1 rule of "assumption": A 4 "elimination" rules: &E, vE, ->E, E 4 "introduction" rules: &I, vI, ->I, I 1 more rule: “RAA” (reductio ad absurdum) = 10 rules

The 10 Rules Rules of Derivation 1 rule of "assumption": A 4 "elimination" rules: &E, vE, ->E, E 4 "introduction" rules: &I, vI, ->I, I 1 more rule: “RAA” (reductio ad absurdum) = 10 rules (later)

SOLVING PROOFS “Natural Deduction”

m &Em &E Doing Proofs The “annotation” page 18

P & Q ⊢ P A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P & Q ⊢ P (1) A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P & Q ⊢ P (1)A A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P & Q ⊢ P (1)P & QA A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P & Q ⊢ P 1(1)P & QA A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P & Q ⊢ P 1(1)P & QA (2)

P & Q ⊢ P 1(1)P & QA (2)P??? Read the sequent! "P" is embedded in the premise. We will have to break it out of the conjunction. Hence &E.

P & Q ⊢ P 1(1)P & QA (2)P???

P & Q ⊢ P 1(1)P & QA (2)P1 &E

P & Q ⊢ P 1(1)P & QA (2)P1 &E

P & Q ⊢ P 1(1)P & QA (2)P1 &E

P & Q ⊢ P 1(1)P & QA (2)P1 &E

P & Q ⊢ P 1(1)P & QA 1(2)P1 &E

m,n &I Doing Proofs The “annotation”

P, Q ⊢ Q & P A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P, Q ⊢ Q & P (1) A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P, Q ⊢ Q & P (1)A A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P, Q ⊢ Q & P (1)PA A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P, Q ⊢ Q & P 1(1)PA A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P, Q ⊢ Q & P 1(1)PA (2) A line of a proof contains four elements: (i) line number (number within parentheses)

P, Q ⊢ Q & P 1(1)PA (2)A A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right)

P, Q ⊢ Q & P 1(1)PA (2)QA A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number)

P, Q ⊢ Q & P 1(1)PA 2(2)QA A line of a proof contains four elements: (i) line number (number within parentheses) (ii) annotation(at the very right) (iii) sentence derived (next to line number) (iv) assumption set (number to very left)

P, Q ⊢ Q & P 1(1)PA 2(2)QA (3)

P, Q ⊢ Q & P 1(1)PA 2(2)QA (3)??? Read the sequent! "P & Q" is not embedded in any premise. We will have to make the conjunction. Hence &I

P, Q ⊢ Q & P 1(1)PA 2(2)QA (3) ?, ? &I

P, Q ⊢ Q & P 1(1)PA 2(2)QA (3)Q & P ?, ? &I

P, Q ⊢ Q & P 1(1)PA 2(2)QA (3)Q & P1, 2 &I

P, Q ⊢ Q & P 1(1)PA 2(2)QA (3)Q & P1, 2 &I

P, Q ⊢ Q & P 1(1)PA 2(2)QA 1,2(3)Q & P1, 2 &I Don't forget to define the assumption set!

P, Q ⊢ Q & P 1(1)PA 2(2)QA 1, 2(3)Q & P1, 2 &I

Homework Memorize the primitive rules, except ->I and RAA Ex (according to these directions) For Each Sequent, answer these two questions: 1.What is the conclusion? 2.How is the conclusion embedded in the premises?