Dependency Lists Whenever you use PA in a proof,

Slides:



Advertisements
Similar presentations
>In We need a rule that will let us prove a conditional. What should the rule be?
Advertisements

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
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.
No new reading for Monday or Wednesday Exam #2 is next Friday, and we’ll review and work on proofs on Monday and Wed.
JEOPARDY Click here and type Category 1 Click here and type Category 2 Click here and type Category 2 Click here and type Category 3 Click here and type.
Lars Arge1 Permuting Lower Bound Permuting N elements according to a given permutation takes I/Os in “indivisibility” model Indivisibility model: Move.
Translating Conditionals Some more advanced issues: 1. ‘only if ’ 2. necessary and sufficient conditions 3. dealing with time.
Double click here to add event title Double click here to add event date Double click here to add event time Double click here to add event location.
Completeness and Consistency So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives. Call this system of 11 rules: P.
Combining > with - Strategies C > -P A[1] 1 P > CGOAL[2] Since the GOAL has the form A > B, use the > In Strategy.
Calendar Editors KCS eLearning. Accepting Invitations  Those who are invited to see the shared calendar will receive an invitation. You must open the.
MGT 230 Week 1 DQ 1 What is management? Why is management necessary? How do you think management has evolved? How has management in your organization evolved?
{P} ⊦ Q if and only if {P} ╞ Q
Times Have Changed Unit 2 Activity 3.
Adding and Subtracting Integers
Click here for the answer. Click here for the answer.
Click here for the answer. Click here for the answer.
[Poster Title] [Your name] abstract methods results background
Elements of Reasoning:
Area and Perimeter of Composite Shapes
Click here for the answer. Click here for the answer.
Proofs with >Out > >Out (1) A (2) A>S (3) S>U
CJ 502 Innovative Education-- snaptutorial.com
..,../' CJ " · "' ; '..
Symbolization Review.
Methods for Evaluating Validity
I am comparing humans to a(n) (type animal here)
-­,-­, '.-.- ·'·' '·..'·..... '-.: - - (p - C!J " 1.,.c_.. If ( '.. ' " ' ' " ' I.
Natural Deduction.
What is the value of -(A>-B) for each of the ways A and B
More Complex Proofs 1. TvP A 2. -P A T GOAL.
மீன்’ பிடிப்போம்’.
Review To check an argument with a tree:.
Midterm Discussion.
Negation Rule Strategies
Click here to add your title
Strategy Review Here is a summary of all the
Strategy Review Here is a summary of all the
Contents Click to add Title Click to add Title Click to add Title
The most important idea in logic: Validity of an argument.
Faculty of Humanities Insert title here.
01 DRAW YOUR TIMELINE HERE JAN. MAR. JAN. MAR. FEB. APR. FEB. APR.
STEP ONE. STEP ONE. STEP ONE. STEP ONE. STEP ONE. 02
Compound Area Compound area is where a shape can be made up of other shapes. The area of a compound shape can be found by calculating the area of the shapes.
회사 소개.
YOUR text YOUR text YOUR text YOUR text
Open Branches Sometimes trees have more than one open branch.
Faculty of Humanities Insert title here.
BUSINESS REPORT 2016.
Refresh: Click Here.
CLICK TO START.
Faculty of Humanities Insert title here.
grade 3-4 addition and subtraction
CLICK TO START.
A more complex example: (L&E)>P | L>P
strategic advice given for Chapters
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Finding the Area of a Rectangle
Check you have all these pieces.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Summary of the Rules A>B -A B -(A>B) A -B --A A AvB A B
Recall that if the antecedent (LHS) of a conditional statement is true, then it will be true if and only if its consequent (RHS) is also true. Therefore,
Faculty of Humanities Insert title here.
Call Now : Click : -
Call Now : Click : -
Call Now : Click : -
Sample Proofs 1. S>-M A 2. -S>-M A -M GOAL.
Click to edit subtitle Click to edit title.
Click here to add your title
Presentation transcript:

Dependency Lists Whenever you use PA in a proof, you need to include dependency lists.

Dependency Lists Whenever you use PA in a proof, you need to include dependency lists. Here is why they are necessary: 1) M>B A 2) M PA 3) B 1,2 >O

Dependency Lists Whenever you use PA in a proof, you need to include dependency lists. Here is why they are necessary: 1) M>B A 2) M PA 3) B 1,2 >O But the argument M>B | B is invalid!

We need a way to keep track of Provisional Assumptions. Dependency Lists Whenever you use PA in a proof, you need to include dependency lists. Here is why they are necessary: 1) M>B A 2) M PA 3) B 1,2 >O But the argument M>B | B is invalid! Moral: We need a way to keep track of Provisional Assumptions.

Moral: We need a way to keep track of Provisional Assumptions. Dependency Lists Whenever you use PA in a proof, you need to include dependency lists. Here is why they are necessary: 1) M>B A 2) M PA 3) B 1,2 >O But the argument M>B | B is invalid! Moral: We need a way to keep track of Provisional Assumptions.

Dependency Lists 1) C>M 2) M>J 3) C 4) M 5) J 6) C>J A PA 1,3 >O 2,4 >O 3-5 >I

Assumptions depend on themselves Dependency Lists 1 2 3 1) C>M 2) M>J 3) C 4) M 5) J 6) C>J A PA 1,3 >O 2,4 >O 3-5 >I Assumptions depend on themselves

Dependency Lists 1 2 3 1,3 1) C>M 2) M>J 3) C 4) M 5) J 6) C>J A PA 1,3 >O 2,4 >O 3-5 >I For >Out, &In, and &Out add together the dependency lists for the lines used.

Dependency Lists 1 2 3 1,3 1,2,3 1) C>M 2) M>J 3) C 4) M 5) J 6) C>J A PA 1,3 >O 2,4 >O 3-5 >I For >Out, &In, and &Out add together the dependency lists for the lines used.

Dependency Lists 1 2 3 1,3 1,2,3 1,2 1) C>M 2) M>J 3) C 4) M 6) C>J A PA 1,3 >O 2,4 >O 3-5 >I For >In, take the list for the consequent, and remove the number for the PA.

Dependency Lists 1 2 3 1,3 1,2,3 1,2 1) C>M 2) M>J 3) C 4) M 6) C>J A PA 1,3 >O 2,4 >O 3-5 >I For >In, take the list for the consequent, and remove the number for the PA. WHY DO YOU REMOVE THE PA NUMBER?

Dependency Lists 1 2 3 1,3 1,2,3 1,2 1) C>M 2) M>J 3) C 4) M 6) C>J A PA 1,3 >O 2,4 >O 3-5 >I For >In, take the list for the consequent, and remove the number for the PA. WHY DO YOU REMOVE THE PA NUMBER? A CONDITIONAL DOES NOT DEPEND ON ITS ANTECEDENT.

For more click here Dependency Lists Why this “proof” does not work: 1 1. M>B A 2 2. M PA 1,2 3. B 1,2 >O No proof is complete if the dependency list contains the number of a PA! For more click here