Derivations overview.

Slides:



Advertisements
Similar presentations
Hypotheticals: The If/Then Form Hypothetical arguments are usually more obvious than categorical ones. A hypothetical argument has an “if/then” pattern.
Advertisements

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)
Semantics of SL and Review Part 1: What you need to know for test 2 Part 2: The structure of definitions of truth functional notions Part 3: Rules when.
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.
Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.
SD: Natural Deduction In S. Valid or Not? 1.If Carol drives, Ann will go to the fair 2.Carol will drive, if Bob goes and pays for gas 3.Bob will pay for.
0 Validity & Invalidity (Exercises) December 23, 2005.
Testing Validity With Venn Diagrams
0 Validity & Invalidity (Exercises) All dogs have two heads. 2. All tigers are dogs. ___________________________________ 3. All tigers have two.
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.
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
LECTURE 17 THE MODAL ONTOLOGICAL ARGUMENT (A VARIANT OF HARTSHORNE’S VERSION)
Higher / Int.2 Philosophy 12. Our Learning  Fallacy Reminder  Summary following Homework NAB  Class NAB.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
THE NATURE OF ARGUMENT. THE MAIN CONCERN OF LOGIC Basically in logic we deal with ARGUMENTS. Mainly we deal with learning of the principles with which.
Module 7 Halting Problem –Fundamental program behavior problem –A specific unsolvable problem –Diagonalization technique revisited Proof more complex 1.
Part One: Assessing the Inference, Deductive and Inductive Reasoning.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Venn Diagram Technique for testing syllogisms
Cosmological arguments from contingency
Chapter 2 Sets and Functions.
Section 2-4 Deductive Reasoning.
Valid and Invalid Arguments
OA: Faith and Reason What difference does the argument make
a valid argument with true premises.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
The ontological argument
Testing Validity With Venn Diagrams
{P} ⊦ Q if and only if {P} ╞ Q
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.
Chapter 9: Successful Paragraphs
Copyright © Cengage Learning. All rights reserved.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
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.
THE ONTOLOGICAL ARGUMENT.
Explore key ideas in the ontological argument. (8 marks)
Inductive Reasoning  Reasoning based on patterns you observe
Anselm & Aquinas December 23, 2005.
Truth Tables Hurley
CS201: Data Structures and Discrete Mathematics I
Truth Trees.
Special Graphs of Inequalities.
1 A The Cosmological Argument Kalam Argument
CS 270 Math Foundations of CS
Natural Deduction.
Propositional Logic.
Midterm Discussion.
Halting Problem.
Computer Security: Art and Science, 2nd Edition
Metatheorems Computational Logic Lecture 8
II. Analyzing Arguments
Calculus Pitfalls By Jordan D. White.
SYNOPTIC REVISION TASK
Logical and Rule-Based Reasoning Part I
For Wednesday, read Chapter 4, section 3 (pp )
Chapter 2: Geometric Reasoning
CS201: Data Structures and Discrete Mathematics I
Compounding.
Doing Derivation.
Introducing Natural Deduction
Validity and Soundness, Again
Logical truths, contradictions and disjunctive normal form
The Main Connective (Again)
Starting out with formal logic
More Derived Rules.
Subderivations.
The conditional and the bi-conditional
Avoiding Ungrounded Assumptions
Presentation transcript:

Derivations overview

Taking stock We’ve come a long way with natural deduction. Before going further, we should take stock, and get some more rigorous definitions in place.

Definitions A Rule of Inference tells when you are allowed, or licensed, to draw a conclusion from one or more sentences or from a whole argument (as represented by a subderivation). Conclusions may only be drawn in accordance with the rules of inference.

Definitions A Derivation is a list of which each member is either a sentence or another derivation. If a first derivation has a second derivation as one of the first derivation's parts, the second derivation is called a Subderivation of the first and the first is called the Outer Derivation, of the second.

Definitions Each sentence in a derivation is a premise or assumption, or a reiteration of a previous sentence from the same derivation or an outer derivation, or a sentence which follows by one of the rules of inference from previous sentences or subderivations of the derivation. Nothing else counts as a legitimate line of a derivation.

Premises and Assumptions Remember the difference between premises and assumptions. Though the rules of inference treat them in just the same way, premises are the unargued sentences assumed at the beginning of the outermost derivation only, whereas assumptions are the unargued sentences assumed at the beginning of subderivations. We always terminate subderivations before the end of the outermost derivation, so assumptions always get discharged, and do not show up as unargued sentences in the outermost derivation.

Scope lines Scope lines help us keep track of our subderivations. More precisely: A Scope Line tells us what sentences and subderivations hang together as a single derivation. Given a vertical scope line, the derivation it marks begins where the line begins and ends where the line ends. The derivation marked by a scope line includes all and only the sentences and subderivations immediately to the right of the scope line.

The trouble with scope lines… A major source of trouble for those starting out with natural deduction is getting scope lines mixed. The conclusions derived within a particular scope line only hold given the assumptions made at the beginning of that scope line. They do not necessarily hold in the outermost derivation. So one cannot reiterate sentences from subderivations in outer derivation. Teller calls this mistake ‘hopping scope lines’. Don’t do it!

For example… In this example, one could not reiterate line 5, ‘~D’, in the outer derivation, say as line 9. This is because ‘~D’ only follows given ‘~G’, which is an assumption of the subderivation, but may well not be true in the outer derivation.

Scope lines So you can’t reiterate sentences from subderivations in their outer derivations. But how about the other way round? Is it permissible to reiterate sentences from outer derivations in subderivations? (And sub-subderivations, and so on?)

Scope lines Yes, absolutely! Subderivations take their special assumptions in conjunction with all the premises and sentences that have been derived from them so far in the proof, and prove things from there. So reiteration is fine from outer derivations to subderivations; and not fine from subderivation to outer derivations.

Examples As with all our topics in logic, practice makes perfect. So here are some practice examples to do: