Aerospace Engineering Laboratory I

Slides:



Advertisements
Similar presentations
Logic ChAPTER 3.
Advertisements

3.5 – Analyzing Arguments with Euler Diagrams
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:
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.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
1 Valid and Invalid Arguments CS 202 Epp Section 1.3 Aaron Bloomfield.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Introduction to Logic Logical Form: general rules
Conditional Statements
Week 1 - Friday.  What did we talk about last time?  Tautologies  Contradictions  Laws of Boolean algebra  Implications  Inverses  Converses 
Adapted from Discrete Math
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2008 Pearson Education, Inc. Chapter 1.
3.6 Analyzing Arguments with Truth Tables
Copyright © Curt Hill Rules of Inference What is a valid argument?
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Section 3.5 Symbolic Arguments
0 Validity & Invalidity (Exercises) December 23, 2005.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Unit 1D Analyzing Arguments. TWO TYPES OF ARGUMENTS Inductive Deductive Arguments come in two basic types:
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
SSK3003 DISCRETE STRUCTURES
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.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
0 Validity & Invalidity (Exercises) All dogs have two heads. 2. All tigers are dogs. ___________________________________ 3. All tigers have two.
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
LOGIC.
Thinking Mathematically Arguments and Truth Tables.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Aim: Invalid Arguments Course: Math Literacy Do Now: Aim: What’s an Invalid Argument? Construct a truth table to show the following argument is not valid.
The construction of a formal argument
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
If-then statements April 4, What is an if-then statement? One of the postulates we looked at earlier stated: If B is between A and C, then AB +
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Chapter 1 Logic and proofs
Logic and Reasoning.
2. The Logic of Compound Statements Summary
Discrete Mathematics Logic.
Methods of Proof A mathematical theorem is usually of the form pq
Information Technology Department
2-1 Conditional Statements
CS201: Data Structures and Discrete Mathematics I
Section 3.5 Symbolic Arguments
3.5 Symbolic Arguments.
Discrete Mathematics Dr.-Ing. Erwin Sitompul
Discrete Mathematics Logic.
8C Truth Tables, 8D, 8E Implications 8F Valid Arguments
CS201: Data Structures and Discrete Mathematics I
3.5 Symbolic Arguments.
Presentation transcript:

2145-391 Aerospace Engineering Laboratory I Logic and Reasoning Logically draw conclusions Extract experimental results Construct a valid reasoning Construct explanations for experimental results Spot valid and invalid reasoning Implication: if p, then q. (p  q) Equivalence: p if and only if (iff) q (p  q)

Motivation: Logically Draw Conclusions Premises/Given: If it rains or it is humid, then I wear blue shirt. If it is cold, then I do not wear blue shirt. It rains. Questions: Logically, can you draw conclusions regarding the condition of the weather, the color of the shirt I wear?

Logic and Reasoning: What is it for? Logically draw conclusions Extract experimental results Construct a valid reasoning Construct explanations for experimental results Spot valid and invalid reasoning

Statement p = I have two legs p is True p = I have four legs p is False Statement is either True or False

Argument/Reasoning Premises: What we assume to be true / given. Conclusions: What we derive from the premises. Argument/Reasoning is either Valid or Invalid

Valid and Invalid Arguments Premises: If x = 2p, then sin x = 0. x = 2p. Conclusion: Therefore, sin x = 0. Valid Premises: If x = 2p, then sin x = 0. sin x = 0. Conclusion: Therefore, x = 2p. Invalid e.g., x = p

Statement VS Argument/Reasoning Statement: True or False Argument/Reasoning: Valid or Invalid

Valid Argument / Reasoning Truth of premise guarantees truth of conclusion. Truth of conclusion necessarily follows truth of premise. No valid argument can have true premise and false conclusion. If the argument is not valid, it is invalid.

Argument 1: Are these arguments/reasoning valid or invalid? Premises: If you rob a bank, then you go to jail. You go to jail. Conclusion: Therefore, you rob a bank. Premises: If x = 2p, then sin x = 0. sin x = 0. Conclusion: Therefore, x = 2p. Activity: Class Discussion Invalid e.g., x = p

Argument 2: Are these arguments/reasoning valid or invalid? Premises: If you rob a bank, then you go to jail. You rob a bank. Conclusion: Therefore, you go to jail. Premises: If x = 2p, then sin x = 0. x = 2p. Conclusion: Therefore, sin x = 0. Activity: Class Discussion Valid

Argument 3: Are these arguments/reasoning valid or invalid? Premises: If you rob a bank, then you go to jail. You do not rob a bank. Conclusion: Therefore, you do not go to jail. Premises: If x = 2p, then sin x = 0. x 2p. Conclusion: Therefore, sin x 0. Activity: Class Discussion Invalid e.g., x = p, sin x = 0

Argument 4: Are these arguments/reasoning valid or invalid? Premises: If you rob a bank, then you go to jail. You do not go to jail. Conclusion: Therefore, you do not rob a bank. Premises: If x = 2p, then sin x = 0. sin x 0. Conclusion: Therefore, x 2p. Activity: Class Discussion Valid

Truth VS Validity They are not the same. Truth for statements. Validity for argument/reasoning. Premises: Dogs have eight legs. [If x is a dog, then x has eight legs.] Spooky is a dog. Conclusion: Spooky has eight legs. The argument is valid. However, the conclusion is false. For further clarification, see lecture note.

Truth VS Validity from Peter Suber, Philosophy Department, Earlham College: http://www.earlham.edu/~peters/courses/log/tru-val.htm. a. Valid Argument b. Invalid Argument 1. True Premises, False Conclusion Premises: Impossible. No valid argument can have true premises and a false conclusion. Cats are mammals. Dogs are mammals. Conclusion: Therefore, dogs are cats. 2. True Premises, True Conclusion Tigers are cats. Tigers are mammals. Therefore, tigers are mammals. Therefore, tigers are cats.

Truth VS Validity from Peter Suber, Philosophy Department, Earlham College: http://www.earlham.edu/~peters/courses/log/tru-val.htm. a. Valid Argument b. Invalid Argument 3. False Premises, False Conclusion Premises: Dogs are cats. Cats are birds. Dogs are birds. Conclusion: Therefore, dogs are birds. Therefore, dogs are cats. 4. False Premises, True Conclusion Birds are mammals. Tigers are birds. Therefore, cats are mammals. Therefore, tigers are cats.

Rules of Inference Argument 2: q p x Rules of Inference Argument 2: Premises: If (p: you rob a bank), then (q: you go to jail). p: You rob a bank. Conclusion: Therefore, q: you go to jail. is not only implication/conditional, Modus Ponens: but it is a tautology (always true). Check truth table.

Rules of Inference Argument 4: q p x Rules of Inference Argument 4: Premises: If (p: you rob a bank), then (q: you go to jail). not-q: You do not go to jail. Conclusion: Therefore, not-p: you do not go to jail. is not only implication/conditional, Modus Tollens: but it is a tautology (always true). Check truth table.

Invalid Logical Fallacies e.g., x = p Fallacy of The Converse Premises: If x = 2p, then sin x = 0. sin x = 0. Conclusion: Therefore, x = 2p. Invalid e.g., x = p

Invalid Logical Fallacies e.g., x = p Fallacy of The Inverse Premises: If x = 2p, then sin x = 0. x = 2p. Conclusion: Therefore, sin x = 0. Invalid e.g., x = p

Logically Draw Conclusions Premises/Given: If it rains or it is humid, then I wear blue shirt. If it is cold, then I do not wear blue shirt. It rains. Questions: Logically, can you draw conclusions regarding the condition of the weather, the color of the shirt I wear?

Premises: Conclusions: ? R = It rains H = It is humid C = It is cold B = I wear blue shirt Premises: If it rains or it is humid, then I wear blue shirt. If it is cold, then I do not wear blue shirt. It rains. Conclusions: ?

I wear blue shirt. It is not cold.

Implications / Conditional

Some Logic: Necessary and Sufficient Conditions (Deductive Reasoning) Implication (Conditional Statement): p  q Note: There is also “inductive reasoning.” p q p q p q p  q Equivalence (~q)  (~p) If p, then q. If not q, then not p. q if p. q whenever p. p only if q. q is a necessary condition for p. p is a sufficient condition for q. Converse of p  q: q  p Contrapositive of p  q: ~ q  ~ p p  q and its contrapositive ~ q  ~ p are equivalent. That is: If p  q is true, ~q  ~ p is also true. If p  q is false, ~ q  ~ p is also false. On the other hand, p  q does not imply q  p. The truth of p  q does not automatically guarantee the truth of q  p.

p q (p  q) (~q ~p) (q p) T F Note that (p  q) and (~q  ~p) always have the same truth value. Some other equivalent relations:

If-then Example

Conditional Statements: If p, then q: PV = mRT (If/Under-the-condition-of/)For a fixed gas and mass of the gas, (if/under-the-condition-of/)and for a fixed temperature: If volume increases, then pressure decreases. If pressure does not decrease, then volume does not increase. Pressure decreases or volume does not increase.

in The Two Jet Noise Reduction Techniques Example Application of Logic in The Two Jet Noise Reduction Techniques