1 / 45

Today’s Topics

Today’s Topics. Review of Grouping and Statement Forms Truth Functions and Truth Tables Uses for Truth Tables Truth Tables and Validity. Putting Words Into Symbols. Statements are either simple (represented by a statement letter ) or compound .

marnie
Download Presentation

Today’s Topics

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. Today’s Topics • Review of Grouping and Statement Forms • Truth Functions and Truth Tables • Uses for Truth Tables • Truth Tables and Validity

  2. Putting Words Into Symbols • Statements are either simple (represented by a statement letter) or compound. • A compound statement is any statement containing at least one connective • In our language a Capital letter stands for an entire simple statement. A dictionary is used to indicate which letters stand for which statements.

  3. When Symbolizing an English Sentence, Identify the Dominant Operator First, and Group AWAY from it. • Paraphrasing Inward • Identify the statement forms of the component sentence(s) and repeat

  4. How paraphrasing inward works: • If Jones wins the nomination or Dexter leaves the party, then Williams is the sure winner. (J, D, W where J = Jones wins the nomination, D = Dexter leaves the party, W=Williams wins). • The sentence is a conditional, so begin by identifying the antecedent and consequent of it. • Underline the antecedent and italicize the consequent.

  5. You get: • If Jones wins the nomination or Dexter leaves the party, then Williams is the sure winner. • Now, begin symbolizing: (Jones wins the nomination or Dexter leaves the party)  Williams is the sure winner • The antecedent is a disjunction, so show that • (Jones wins the nomination ▼ Dexter leaves the party)  Williams is the sure winner • Finally, replace statements with statement letters • (J ▼ D)  W and you are done!

  6. Logical Operators, Truth Functions and Truth Tables

  7. Our 5 logical operators produce statement forms that are truth-functional • Negation ~p • Conjunction p  q • Disjunction p ▼ q • Conditional p  q • Biconditional p  q

  8. Truth-Functions • A truth function takes one or more truth values as input and returns one truth value as the output • Truth functional operators determine the truth value of a compound statement given the truth values of the simple statements in it

  9. Truth Tables • Chapter 7 of the text discusses truth tables. • A truth table is a complete list of all the possible permutations of truth and falsity for a set of simple statements, showing the effect of each permutation on the truth value of a compound having those simple statements as components.

  10. Truth Tables • Each permutation of truth values constitutes one row of a truth table and the number of rows in a truth table is 2n where n equals the number of simple statements. • The truth value of any compound statement is determined by the truth values of its component sentences. • Note that I use the symbol  to denote “false.”

  11. S1 S2 possibility 1 possibility 2 possibility 3 possibility 4 How many permutations are there? A set of statements containing 2 simple statements has 4 permutations T T T   T  

  12. A statement with 3 simple statements has 8 permutations

  13. Truth Tables for the Basic Truth Functional Operators

  14. Uses for Truth Tables • Determine the truth conditions for any compound statement

  15. Building a Truth-Table S case R (~R  ~S) 1 T T    2 T    T 3  T T   4   T T T

  16. Building a Truth-Table case R S (~R  ~S) 1 T T    2 T   T T 3  T T T  4   T T T

  17. Building a Truth-Table case R S [(RS)  ~S] 1 T T T   2 T    T 3  T T   4   T T T

  18. Uses for Truth Tables • Determine the truth conditions for any compound statement • Determine whether a statement is a tautology, a contradiction or neither (contingent) • Download the Handout on Truth Tables, work the problems and then discuss them on the bulletin board.

  19. Tautologies and Contradictions • A tautology is a statement that is true in virtue of its logical form. It is true under all possible circumstances. • A contradiction is a statement that is false in virtue of its logical form. It is false under all possible circumstances.

  20. Tautologies and Contradictions • The column for the dominant operator of a tautology will contain only “Trues.” The column for the dominant operator of a contradiction will contain only “Falses.”

  21. Truth-Table Test for tautology, contradiction, contingent statements case R S [(R  S)  R]  S T T T 1 T T 2 T    T T  T 3  T 4   T  T Is the formula a tautology, a contradiction, or a contingent statement? TAUTOLOGY

  22. Truth-Table Test for tautology, contradiction, contingent statements (R  ~R)  (S  ~S) case R S T   1 T T T   2 T  T   3  T T   4   Is the formula a tautology, a contradiction, or a contingent statement? CONTRADICTION

  23. Truth-Table Test for tautology, contradiction, contingent statements case R S [(R  S)  S]  R 1 T T T T T 2 T    T T T  3  T 4   T  T Is the formula a tautology, a contradiction, or a contingent statement? CONTINGENT

  24. Uses for Truth Tables • Determine the truth conditions for any compound statement • Determine whether a statement is a tautology, a contradiction or neither, • Determine whether two formulae are equivalent.

  25. Equivalence • Two formulae are said to be equivalent if, but only if, those formulae are true and false under exactly the same conditions, that is, if, but only if, the truth table columns for the dominant operators are identical.

  26. Testing for Equivalence • To use a truth table to test two formulae for equivalence, begin by constructing truth table columns for each formula. Use one set of guide columns for both formulae. • Compare the columns for the dominant operators of the two formulae. If the truth values agree in each row, the formulae are equivalent. • Download the Handout on Testing for Equivalence and work the problems.

  27. Truth-Table Test for Equivalence ( R  S ) :: ~ R  S T T T  T T T T    T    T T T  T T  T  T  T  Do the formulas match in truth value? YES Are the two formulas logically equivalent? YES

  28. Truth-Table Test for Equivalence ~ ( R  S ) :: ~ R  ~ S  T T T  T   T T T    T  T  T   T T    T T    T  T T  Do the formulas match in truth value? NO Are the two formulas logically equivalent? NO

  29. Truth-Table Test for Equivalence ~ ( R  S ) :: ~ R  ~ S  T T T  T   T T T    T T T  T   T T  T  T T    T  T T  Do the formulas match in truth value? YES Are the two formulas logically equivalent? YES

  30. Truth-Table Test for Equivalence ~ ( R  S ) :: ~ R  ~ S  T T T  T   T  T T   T T T    T T T  T  T T    T  T T  Do the formulas match in truth value? NO Are the two formulas logically equivalent? NO

  31. Truth-Table Test for Equivalence ~ ( R  S ) :: ~ R  ~ S  T T T  T   T  T T   T  T    T T T    T T    T  T T  Do the formulas match in truth value? YES Are the two formulas logically equivalent? YES

  32. Do Not Distribute a Negation Across A Conjunction or a Disjunction! not ( R and S)  not R andnot S not ( R or S)  not R ornot S

  33. Rather. . . not R ornot S not ( R and S) = not ( R or S) = not R andnot S

  34. Uses for Truth Tables • Determine the truth conditions for any compound statement • Determine whether a statement is a tautology, a contradiction or neither, • Determine whether two formulae are equivalent. • Determine whether an argumentis valid or not.

  35. Logical Implication • One statement logically implies another if, but only if, whenever the first is true, the second is true as well • If a statement, S1, implies S2 then the conditional (S1 S2) will be a tautology. Implication is the validity of the conditional. • Truth tables allow one to test for logical implication

  36. Validity and Logical Implication • An argument is valid if, but only if, its premises logically imply its conclusion.

  37. Deductive Validity • A characteristic of arguments in which the truth of the premises guarantees the truth of the conclusion. • A characteristic of arguments in which the premises logically imply the conclusion.

  38. Truth Table Tests for Validity • Construct a column for each premise in the argument • Construct a column for the conclusion • Examine each row of the truth table. Is there a row in which all the premises are true and the conclusion is false. If so, the argument is non-valid. If not, then the argument is valid. • Download the Handout on Testing for Validity.

  39. Truth-Table Test for Validity for R  S, RSModus Ponens (MP) case R S R S R S 1 T T T T T 2 T   T  3  T T  T 4   T   Is there a case in which the premises are all true but the conclusion is false? NO VALID Is the argument form valid or non-valid?

  40. Truth-Table Test for Validity for R  S, ~S~RModus Tollens (MT) case R S R S ~S ~R 1 T T T   2 T   T  3  T T  T 4   T T T Is there a case in which the premises are all true but the conclusion is false? NO VALID Is the argument form valid or non-valid?

  41. Truth-Table Test for Validity for R  S, ~R~SEvil Twin of Modus Tollens case R S R S ~R  ~S 1 T T T   2 T    T 3  T T T  4   T T T Is there a case in which the premises are all true but the conclusion is false? YES NON-VALID Is the argument form valid or non-valid?

  42. Truth-Table Test for Validity for R  S, SRFallacy of Affirming the Consequent case R S R S S R 1 T T T T T 2 T    T 3  T T T  4   T   Is there a case in which the premises are all true but the conclusion is false? YES Is the argument form valid or non-valid? NON-VALID

  43. Truth-Table Test for Validity for R  S, R ~S case R S R S R ~S 1 T T T T  2 T  T T T 3  T T   4     T Is there a case in which the premises are all true but the conclusion is false? YES Is the argument form valid or non-valid? NON-VALID

  44. Truth-Table Test for Validity for R  S, ~R SDisjunctive Syllogism (DS) case R S R S ~R S 1 T T T  T 2 T  T   3  T T T T 4    T  Is there a case in which the premises are all true but the conclusion is false? NO Is the argument form valid or non-valid? VALID

  45. Key Ideas • Grouping and Meaning • Paraphrasing Inward • Truth Functional Operators • Truth Tables • Using Truth Tables • Testing for tautologies and contradictions • Testing for equivalence • Testing for validity

More Related