Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
The Foundations: Logic and Proofs
Higher / Int.2 Philosophy 5. ” All are lunatics, but he who can analyze his delusion is called a philosopher.” Ambrose Bierce “ Those who lack the courage.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
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.
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.
Muhammad Arief download dari
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Logic 3 Tautological Implications and Tautological Equivalences
Essential Deduction Techniques of Constructing Formal Expressions and Evaluating Attempts to Create Valid Arguments.
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
Discrete Mathematics and its Applications
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Propositional Proofs 2.
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.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
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).
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
From Truth Tables to Rules of Inference Using the first four Rules of Inference Modus Ponens, Modus Tollens, Hypothetical Syllogism and Disjunctive Syllogism.
Philosophy: Logic and Logical arguments
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
CS2013 Mathematics for Computing Science Adam Wyner University of Aberdeen Computing Science Slides adapted from Michael P. Frank ' s course based on the.
6.6 Argument Forms and Fallacies
Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.
What is Reasoning  Logical reasoning is the process of drawing conclusions from premises using rules of inference.  These inference rules are results.
MATHEMATICAL REASONING MATHEMATICAL REASONING. STATEMENT A SENTENCE EITHER TRUE OR FALSE BUT NOT BOTH A SENTENCE EITHER TRUE OR FALSE BUT NOT BOTH.
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) 
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
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.
Deductive reasoning.
2. The Logic of Compound Statements Summary
Knowledge Representation and Reasoning
Discrete Mathematics Logic.
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.
Demonstrating the validity of an argument using syllogisms.
Rules of Inference Section 1.6.
6.1 Symbols and Translation
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.
CS201: Data Structures and Discrete Mathematics I
Deductive Reasoning: Propositional Logic
CS 270 Math Foundations of CS
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Back to “Serious” Topics…
The Method of Deduction
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Natural Deduction Hurley, Logic 7.1.
Discrete Mathematics Logic.
Natural Deduction Hurley, Logic 7.2.
Natural Deduction Hurley, Logic 7.3.
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Chapter 8 Natural Deduction
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction.
Presentation transcript:

Symbolic Logic ⊃ ≡ · v ~ ∴

What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a piece of deductive* reasoning and determine whether it is correct or not – to determine if the argument is valid or invalid. As a debater, logic is your tool to assess arguments – yours and your opponents – with accuracy and precision.

What is a logical argument? *A deductive argument is one that, if valid, has a conclusion that is entailed by its premises. Meaning, the truth of the conclusion is a logical consequence of the premises—if the premises are true, then the conclusion must be true.

Review: Valid: The conclusion of the argument follows logically from its premises. Sound: The argument is valid and all of its premises are true. Symbolic logic is used to check the validity of an argument, not the truth of its premises (that is what research of evidence for).

A logical argument has three stages: Premises: The claims that are given in support of an argument -- the building blocks of a logical argument. A premise is a propositional statement which is either true or false. Inference: The logical move from one or more premises to arrive at its conclusion. All inferences must abide by a rule of inference for an argument to be valid. Conclusion: The premise that is the consequence, or product, of the above premises + inference.* *A conclusion can then itself become a premise (building block) of a continued or new argument.

What is a logical argument? A logical argument has three stages: 1) If data suggests that students would get more sleep with a later start time, then WHS will change its start time to 9 am (premise 1) 2) Data does suggest that students would get more sleep with a later start time. (premise 2) _____________________ (Inference, M.P.) 3) Therefore, WHS will start at 9 am. (conclusion)

What is symbolic logic? Symbolic logic symbolizes arguments for simple, efficient assessment of validity. As arguments get longer and more complex, symbols are especially important. 1) If data indicates that students would get more sleep, then WHS will change its start time to 9 am (premise 1) 2) Data indicates that students would get more sleep (premise 2) _____________________ (Inference, M.P.) 3) Therefore, WHS will start at 9am. (conclusion)

For example: 1) If Data indicates that students would get more sleep, then WHS will change its Start time to 9 am (premise 1) 2) Data indicates that students would get more sleep (premise 2) _____________________ (Inference) 3) Therefore, WHS will Start at 9am. (conclusion) Becomes… 1) D ⊃ S 2) D ______________ 3) ∴ S (M.P.) This argument is deemed valid by use of inference rule Modus Ponens (M.P.)

Rules of Inference Modus Ponens (M.P.) p ⊃ q p ∴ q Modus Tollens (M.T.) p ⊃ q ~q ∴ ~p Hypothetical Syllogism (H.S.) p ⊃ q q ⊃ r ∴ p ⊃ r Disjunctive Syllogism (D.S.) p v q ~p ∴ q Constructive Dilemma (C.D.) (p ⊃ q) · (r ⊃ s) p v r ∴ q v s Destructive Dilemma (D.D.) (p ⊃ q) · (r ⊃ s) ~q v ~s ∴ ~p v ~r Simplification (Simp.) p · q ∴ p Conjunction (Conj.) p q ∴ p · q Addition (Add.) p ∴ p v q

Symbols Key Name Symbol Reads as: Conditional ⊃ “if ____, then____” Biconditional ≡ “____if and only if ____” Conjunction · “____ and ____” Disjunction v “____ or ____ (but not neither)” Negation ~ “not ____” Conclusion ∴ “Therefore, ____”

Modus Ponens (M.P.) 1) s ⊃ c 2) s ______________ 3) ∴ c 1) If you Smoke, then you increase your risk of Cancer. 2) You Smoke. ______________________ 3) Therefore, you increase your risk of Cancer. (M.P.)

Modus Ponens (M.P.) 1) c ⊃ f 2) c ______________ 3) ∴ f 1) If one is a Cat, then one has Four legs. 2) I have Four legs. ______________________ 3) Therefore, I am a cat. 1) c ⊃ f 2) f ______________ 3) ∴ c

Modus Tollens (M.T.) 1) s ⊃ b 2) ~b ______________ 3) ∴ ~s 1) If it is Snowing, then it is 32 F or Below. 2) It is not 32 F or Below. _____________ 3) Therefore, it is not Snowing. (M.T.)

Hypothetical Syllogism (H.S.) c ⊃ m m ⊃ s ∴ c ⊃ s 1) If you give a mouse a Cookie, then he will want Milk. 2) If you give a mouse Milk, then he will want a Straw. ______________________ 3) Therefore, If you give a mouse a Cookie, then he will want a Straw. (H.S.)

Disjunctive Syllogism (D.S.) p v q ~p ∴ q 1) You must have a Salad or Cup of soup. 2) You do not choose to have a Salad. ______________________ 3) Therefore, you must choose to have a Cup of soup. (D.S.) Note: The wedge “v”, used to symbolize “or” means you can have one, the other, or both, but not neither. It is used like “and/or”.

Constructive Dilemma (C.D.) (c ⊃ m) · (i ⊃ s) c v i ∴ m v s 1) If you give a mouse a Cookie, then he will want Milk, and If you give a mouse Ice cream, then he will want Sprinkles 2) The mouse can have a Cookie or Ice cream. ______________________ 3) Therefore, the mouse must have Milk or Sprinkles. (C.D.)

Destructive Dilemma (D.D.) (c ⊃ m) · (i ⊃ s) ~m v ~s ∴ ~c v ~i 1) If you give a mouse a Cookie, then he will want Milk, and If you give a mouse Ice cream, then he will want Sprinkles. 2) The mouse must choose between no Milk or no Sprinkles. ______________________ 3) Therefore, the mouse must choose between no Cookie or no Ice cream. (D.D.)

Simplification (Simp.) g · b ∴ g 1)WHS has Girl students and Boy students. _____________ 2) Therefore, WHS has Girl students. (Simp.)

Conjunction (Conj.) p q ∴ p · q 1)WHS has Girl students. 2)WHS has Boy students. _____________ 2) Therefore, WHS has Girl and Boy students. (Conj.)

Addition (Add.) g ∴ p v q 1)WHS has Girl students. ________________ 2) WHS has Girl students or Boy students. (Add.) Remember: The wedge (v) means you can have one, the other, or both, but not neither -- like “and/or”.