Chapter 4: Derivations 80-210: Logic & Proofs July 7, 2009 Karin Howe.

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 9) Or.
Advertisements

Word List A.
Help me out.
The.
Introduction to Theorem Proving
Logic Use mathematical deduction to derive new knowledge.
Direction Intensity Persistence
Mr Barton’s Maths Notes
No new reading for Monday or Wednesday Exam #2 is next Friday, and we’ll review and work on proofs on Monday and Wed.
100 Most Common Words.
1st 100 sight words.
1 Understanding and Handling the Personal Power for Children Nurturing Parenting.
Discrete Mathematics and Its Applications
The Forward-Backward Method The First Method To Prove If A, Then B.
sat by a riversaw a rabbit jumped down a big holefound a small door in the hall Lead-in.
Alice’s Adventures in Wonderland
Journal 16 August 2010 Describe something you did this past summer.
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.
Methods of Proof involving  Symbolic Logic February 19, 2001.
Unit 6 Outdoor fun Task. Learning aims : 1. Describe a thing clearly. 2.Continue to write a story based on the one we have known.
Grimm's Fairy Tale Little Red Riding Hood Based on the story by Jacob and Wilhelm Grimm.
Finding the Request Form on the Website: You can also go to the main Read to Me page,
Determining Validity and Invalidity in Deductive Arguments PHIL 121: Methods of Reasoning February 6, 2013 Instructor:Karin Howe Binghamton University.
Natural Deduction CS 270 Math Foundations of CS Jeremy Johnson.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
I.
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.
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
Argument Diagramming Part I
Word Recognition in Isolation List 1. Give child directions Words will start on click.
High Frequency Words August 31 - September 4 around be five help next
Methods of Proof for Boolean Logic Chapter 5 Language, Proof and Logic.
Formal Proofs and Boolean Logic Chapter 6 Language, Proof and Logic.
Alice in Wonderland.. 1 Alice ……………………. [sit] for a long time in the garden with her sister when she ………….. [see] a white rabbit: he …………………. [wear] a.
Proof Tactics, Strategies and Derived Rules CS 270 Math Foundations of CS Jeremy Johnson.
Grammar: Inversion Edited by WANG CHAO QUN. 1.Had I known what was going to happen, I would never have left her alone. (=If I had known what was going.
Chapter 4: Derivations PHIL 121: Methods of Reasoning April 10, 2013 Instructor:Karin Howe Binghamton University.
Forward and Backward Chaining
Chapter 5: Indirect Rules : Logic & Proofs July 9, 2009 Karin Howe.
Introduction to Logic Lecture 13 An Introduction to Truth Tables By David Kelsey.
Sit or Set Can, or May Unit 3, Lesson 15. Objectives Students will: Use the words sit, set, can, and may correctly in sentences. Proofread for correct.
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.
First Grade Sight Words. the of and a an to.
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Oxford Words
{P} ⊦ Q if and only if {P} ╞ Q
Enjoy the most popular song (神曲)
Identifying Counterexamples
A v B ~ A B > C ~C B > (C . P) B / ~ B mt 1,2 / B ds 1,2
Fry’s High Frequency Words
Truth Trees.
CS 270 Math Foundations of CS
Natural Deduction.
Midterm Discussion.
Proof Strategies PHIL 122 Fall 2012 Karin Howe.
Reasoning with the Propositional Calculus
Quarter 1.
Reasoning with the Propositional Calculus
Proof Tactics, Strategies and Derived Rules
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Trick Words 1st grade.
Two other people.
High Frequency Words Set #1.
Introductory Logic PHI 120
1st Grade High-Frequency Words
Chapter 5: Indirect Rules
Presentation transcript:

Chapter 4: Derivations : Logic & Proofs July 7, 2009 Karin Howe

(In)troduction Rules ConjunctionDisjunctionConditional &I  IL  IR II p q__________ p & q &I p________ q  p  IL p________ p  q  IR p  q  I p..qp..q A

Strategies Backwards Strategy –Start by placing your goal at the bottom and then try to specify a line or lines from which you can get your goal in a single step. Then do the same for the lines you specified and repeat until you work your way up to the premises. Arrow In Strategy –When your goal is a conditional, try assuming its antecedent in the hope of deriving its consequent.

Practice Using Introduction Rules in the CPL Practice Using Conjunction Introduction Practice Using Disjunction Introduction Practice Using Conditional Introduction Practice Using Introduction Rules

Elimination (Out) Rules ConjunctionDisjunctionConditional &EL&ER EE EE p & q_____ p &EL p & q_____ q &ER p  q r p  q p________ q  E p A r q A r

Strategies, con't Or-Out Strategy –Use when you have a disjunction available whose disjuncts might imply your goal. Assume each disjunct separately and try to derive your goal from each. If you succeed, derive your goal from the disjunction and the goal derived from each disjunct by Or Elimination. Poof Variant on Or-Out Strategy –Use when your goal is a disjunction and when you have a disjunction available whose disjuncts might imply your goal. Assume each disjunct of the original disjunction separately and use it to try to derive one side of the disjunction which is your goal. Poof in the other side of the disjunction. If you succeed in arriving at your goal disjunction for both cases, derive the disjunction which is your goal from the original disjunction and the goal derived from each disjunct by Or Elimination.

Practice Using Elimination Rules in the CPL Practice Using Conditional Elimination Practice Using Conjunction Elimination Practice Using Disjunction Elimination Practice Using Elimination Rules

Putting It All Together … Practice Using the Binary Rules Any more questions?? If not, then how about some more practice?

"Aha!" said Pooh (Rum-tum-tiddle-um-tum.) "If I know anything about anything, that hole means Rabbit," he said, "and Rabbit means Company," he said, "and Company means Food…" There is a rabbit hole here. A rabbit hole means that there is a rabbit nearby. If there is a rabbit nearby, then there is company around. If there is company around, then there is food available. Thus, there is food available. H, R, R  C, C  F  F

"My friend, you'll help in this thing–for my sake–that's why you're here–I mightn't be able alone. If you flinch, I'll kill you. Do you understand that? And if I have to kill you, I'll kill her–and then I reckon nobody'll ever know much about this little business." If you flinch, I'll kill you. And if I have to kill you, I'll kill her. Therefore, I'll kill both of you, if you flinch. F  Y, Y  H  F  (Y & H)

The cake will either make me larger or smaller. If it makes me larger, I can reach the key; and if it makes me smaller, I can creep under the door. If I reach the key, I'll get into the garden; and if I creep under the door, I'll get into the garden. So [either way] I'll get into the garden. L  S, (L  K) & (S  C), (K  G) & (C  G)  G Soon her eye fell on a little glass box that was lying under the table: she opened it, and found in it a very small cake, on which the words "EAT ME" were beautifully marked in currants. "Well, I'll eat it." said Alice, "and if it makes me larger, I can reach the key; and if it makes me smaller, I can creep under the door; so either way I'll get into the garden, and I don't care which happens!"