A v B ~ A B > C ~C B > (C . P) B / ~ B mt 1,2 / B ds 1,2

Slides:



Advertisements
Similar presentations
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Advertisements

Proofs using all 18 rules, from Hurley 9th ed. pp Q > (F > A) 2. R > (A > F) 3. Q ∙ R / F ≡ A (J ∙ R) > H 2. (R > H) > M 3. ~(P v.
Logic & Critical Reasoning
1 Section 6.3 Formal Reasoning A formal proof (or derivation) is a sequence of wffs, where each wff is either a premise or the result of applying a proof.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Use a truth table to determine the validity or invalidity of this argument. First, translate into standard form “Martin is not buying a new car, since.
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
Logic 2 The conditional and biconditional
Today’s Topics n Review of Grouping and Statement Forms n Truth Functions and Truth Tables n Uses for Truth Tables n Truth Tables and Validity.
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.
PHIL 120: Jan 8 Basic notions of logic
Chapter 24: Some Logical Equivalences. Logically equivalent statement forms (p. 245) Two statements are logically equivalent if they are true or false.
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
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.
DeMorgan’s Rule DM ~(p v q) :: (~p. ~q)“neither…nor…” is the same as “not the one and not the other” ~( p. q) :: (~p v ~q) “not both…” is the same as “either.
Mathematical Structures for Computer Science Chapter 1.2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Today’s Topics Review of Sample Test # 2 A Little Meta Logic.
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements when switching order of antecedent and consequent If the car starts, there’s gas in the tank.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Natural Deduction Proving Validity. The Basics of Deduction  Argument forms are instances of deduction (true premises guarantee the truth of the conclusion).
From Truth Tables to Rules of Inference Using the first four Rules of Inference Modus Ponens, Modus Tollens, Hypothetical Syllogism and Disjunctive Syllogism.
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.
assumption procedures
LOGIC.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
2. 1. G > T 2. (T v S) > K / G > K (G v H) > (S. T) 2. (T v U) > (C. D) / G > C A > ~(A v E) / A > F H > (I > N) 2. (H > ~I) > (M v N)
Chapter 23: Enthymemes, Argument Chains, and Other Hazards.
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.(p  q) 2. (r  s) 3. p v r  q v s 4. (p  q)  (r  s) conj. 1,2 5. q v sC.D. 3,4.
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) 
Introduction to Logic Lecture 12 An introduction to Sentence Logic By David Kelsey.
Introduction to Logic Lecture 12 An introduction to Sentence Logic By David Kelsey.
Formal logic The part of logic that deals with arguments with forms.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
2. The Logic of Compound Statements Summary
Application: Digital Logic Circuits
a valid argument with true premises.
Natural Deduction: Using simple valid argument forms –as demonstrated by truth-tables—as rules of inference. A rule of inference is a rule stating that.
Ch.1 (Part 1): The Foundations: Logic and Proofs
{P} ⊦ Q if and only if {P} ╞ Q
Demonstrating the validity of an argument using syllogisms.
6.1 Symbols and Translation
Information Technology Department
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.
Truth Trees.
Deductive Reasoning: Propositional Logic
CS 270 Math Foundations of CS
Natural Deduction 1 Hurley, Logic 7.4.
TRUTH TABLES.
Midterm Discussion.
8.2 Using the Rule of Inference
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Natural Deduction Hurley, Logic 7.1.
1. (H . S) > [ H > (C > W)]
The Logic of Declarative Statements
Guess the letter!.
Logical Entailment Computational Logic Lecture 3
Natural Deduction Hurley, Logic 7.2.
Natural Deduction Hurley, Logic 7.3.
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements
Chapter 8 Natural Deduction
Doing Derivation.
Substitution.
The Main Connective (Again)
Summary of the Rules A>B -A B -(A>B) A -B --A A AvB A B
Starting out with formal logic
Presentation transcript:

A v B ~ A B > C ~C B > (C . P) B / ~ B mt 1,2 / B ds 1,2 / C . P mp 1,2 ~~S R > ~S A v B C > D / ~ R mt 1,2 / (A v B) . (C > D) cn 1,2 A > (B. C) (B . C) > K 1. (L > M) . (D v N) / L > M sm 1 / A > K hs 1,2

R . T premise R > S premise R ___ S ___ 1 sm 2,3 mp B > P premise P > X premise B > X ___ (B > X) . (B > P) ___ 1,2 hs 3,1 cn

~ (A > P) > ~S premise 2, dn 1,3 mt 4, dn (D v S) > (P . Q) premise S v D premise D v S ___ P . Q ___ Q . P ___ Q ___ 2, cm 3,1 mp 4, cm 5 sm

P . (Q . R) premise (P . Q) . R ___ R . (P . Q) ___ R ___ 1, as 2, cm 3 sm S > (A . (B v C)) premise S premise A . (B v C) ___ B v C ___, ___ 1,2 mp 3, cm , sm (L v X) > (A . B) premise M premise M > (X v L) premise (X v L) > (A . B) ___ M > (A . B) A . B ___ A ___ B ___ 1 cm 3,4 hs 2,5 mp 6 sm 6 cm, sm

J > (K > L) premise L v J premise ~L premise J ___ K > L ___ ~K ___ 2,3 ds 1,4 mp 3,5 mt ~G > ( G v (S > G)) premise (S v L) > ~G premise S v L premise ~ G ___ G v (S > G) ___ S > G ___ ~S ___ L ___ 2,3 mp 1,4 mp 4,5 ds 4,6 mt 3,7 ds

(K . B) v ( ~L > E) ~( B . K) ~E / L (K . O) > (N v T) O K / T v N (R > F) > ((R > ~G) > (S > Q)) (Q > F) > (R > Q) ~G > F Q > ~G / S > F If a tenth planet exists, its orbit is perpendicular to that of the other planets. Either a tenth planet is responsible for the death of the dinosaurs or its orbit is not perpendicular to that of the others. A tenth planet is not responsible for the death of the dinosaurs, so there is no tenth planet.

How do you approach doing a proof? First, you look to see if the conclusion –at least a piece of it—can be located in one of the premises: here you spot it in line 1, as the consequent. Unfortunately, the order of the letters is wrong. But that tells us two things: Commutation will be the final step of the proof; and MP will be the one before that. How do we know? 1. (K . O) > (N v T) 2. O 3. K / T v N Because MP is the rule that delivers a consequent, and CM is the rule that switches the order of letters around dots and wedges. 4. K . O CN 2,3 5. N v T MP 4, 1 6. T v N CM 5

1. (K . B) v ( ~L > E) 2. ~( B . K) 3. ~E / L Find the conclusion in the premise: It’s in line 1, but it’s negated! Not only that, but it’s in the location of an antecedent. Negated antecedent? Sounds like MT. Can we use line 3 with line 1 to get ~~L (which is equivalent to L by DN)? No! MT –and all the rules of inference—only works at the main operator of a line; the main operator of 1 is a wedge. You’ll have to use DS to break the right-hand disjunct out of 1 and put it on a line by itself. To that line you could do MT. CM will change the order of B and K; you can either change line 1 or change line 2 –one of them has to be changed so that they match up exactly for DS.

1. (K . B) v ( ~L > E) 2. ~( B . K) 3. ~E / L 4. ~( K . B) CM 2 5. ~L > E DS 1,4 6. ~~L MT 5,3 7. L DN 6

As you might expect, if you are just guessing, If you don’t start out by looking for the conclusion –or a piece of it at least– in the premises, then you are just guessing. As you might expect, if you are just guessing, it’s just a matter of luck. That’s not how to succeed in Logic, though.