1 / 21

Chapter 3: Introduction to Logic

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 theory, but also in the real world any time someone is trying to convince you of something.

dieter
Download Presentation

Chapter 3: Introduction to Logic

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 3: Introduction to Logic

  2. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math theory, but also in the real world any time someone is trying to convince you of something. To analyze an argument, we break it down into smaller pieces: statements, logical connectives and quantifiers.

  3. Statements • A statement is a declarative sentence that is either true or false (but not both at the same time) • A compound statement consists of simple statements combined using logical connectives like and, or, not, if…then. • The negation of a statement must have the opposite truth value to the original statement

  4. Connectives and Symbols

  5. Quantifiers • Universal quantifier: all, every, each. Statement is true if the claim is true for every object it is referring to. • Existential quantifier: some, there exists, for at least one. Statement is true if the claim is true for al least one object it is referring to.

  6. Negations of Quantified Statements

  7. Truth Tables • Shows truth value of a compound statement for all possible truth values of the component statements • If there are n component statements, then the truth table has 2n rows

  8. Conjunction

  9. Disjunction

  10. Negation

  11. Equivalent Statements • Two statements are equivalent if they have the same truth value for every possible situation, and we write p≡ q • De Morgan’s Laws: ~(p q) ≡ ~p  ~q ~(p q) ≡ ~p  ~q

  12. The Conditional • If p, then q • Symbols: p→ q • p is the antecedent, q is the consequent

  13. Truth Table for Conditional

  14. Useful results for the Conditional • Equivalent to a disjunction: p→q≡ ~pq • Negation: ~(p→q) ≡p ~q

  15. Related Conditional Statements

  16. Equivalences Direct statement and contrapositive are equivalent: p → q ≡ ~q → ~p Converse and Inverse are equivalent: q → p ≡ ~p → ~q

  17. Common wording for p→q

  18. Analyzing Arguments • We will use deductive reasoning to determine whether logical arguments are valid or invalid. • A logical argument is made up of premises (assumptions, statements assumed to be true) and a conclusion. • An argument is valid if the fact that all the premises are true forces the conclusion to be true. • An argument that is not valid is invalid, or a fallacy.

  19. Techniques to Analyze Arguments • Using truth values(assume premises are true and see if this forces conclusion to be true) • Comparing with known valid or invalid arguments

  20. Valid Argument Forms • Modus Ponens [(p→q)  p] → q • Modus Tollens [(p → q)  ~q] → ~p • Disjunctive Syllogism [(p  q)  ~p] → q • Transitivity [(p → q)  (q → r)] → (p → r)

  21. Fallacies • Fallacy of the Converse [(p→ q)  q] → p • Fallacy of the Inverse [(p→ q)  ~p] → ~q

More Related