1 / 48

Truth Tables

Truth Tables. How to build them. How to use them to determine logical properties of statements. How to use them to determine logical relations between statements. How to use them to determine validity or invalidity. A truth table exhibits all the possible truth values

nickk
Download Presentation

Truth Tables

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. Truth Tables How to build them How to use them to determine logical properties of statements How to use them to determine logical relations between statements How to use them to determine validity or invalidity

  2. A truth table exhibits all the possible truth values of a set of simple statements The number of lines the table requires, to show all possible truth values, depends on the number of simple statements in the example. The number of lines needed is 2 to the nth power, where “n” is the number of distinct simple statements (p . q) v ~(p . q) p > q (p v q) . r 4 lines 8 lines 4 lines

  3. Fill in the truth values for the simple statements Start on the left, and halve the number of rows Make the first half True, the second half False At the next simple statement, halve the number you halved. Make the first half of those True, the next half false Continue until you get a column reading T F T F

  4. ~ ( p v q)

  5. ~ ( p v q)

  6. ~ ( p v q)

  7. p v ( q . r)

  8. p v ( q . r)

  9. p v ( q . r)

  10. (p > q) . ( r > s)

  11. (p > q) . ( r > s)

  12. (p > q) . ( r > s)

  13. (p > q) . ( r > s)

  14. All three examples just seen have a feature in common: Each statement is TRUE on some lines of the table, but FALSE on others Look under the MAIN OPERATOR to see the final truth value for the statement

  15. A statement that is T sometimes, and F other times is called “CONTINGENT” This means that its truth value depends upon (is contingent upon) the truth value of the simple statements.

  16. There are two other possibilities The value under the main operator is TRUE in all cases Tautology Or: the value under the main operator is FALSE in all cases Self-Contradiction

  17. (A . B) v ~ ( A . B)

  18. (A . B) v ~ ( A . B)

  19. (A . B) v ~ ( A . B)

  20. (A . B) v ~ ( A . B) T T T T

  21. (p > q) . (~q . p)

  22. (p > q) . (~q . p)

  23. When a statement is always TRUE or always FALSE, regardless of the truth value of its component statements, this is due to its structure or form – not to its content. This is similar to the point made about DEDUCTION in general: validity is a function of structure or form.

  24. Logical properties of truth-functional compound statements Contingent Tautologous Self-contradictory

  25. Truth tables can also show relationships between statements or sets of statements ~ (p v q) (~ p v ~ q) Take a minute, and write up the truth tables for these

  26. ~ (p v q) (~p v ~q)

  27. ~ (p v q) (~p v ~q)

  28. ~ (p v q) (~p v ~q) Sometimes these are the same as one another, but not always: they are not equivalent.

  29. Between any two (or three or four, etc) statements, there are four possibilities: They may be EQUIVALENT: having the same value under the main operator on every line They may be CONTRADICTORY: having opposite values under the main operator on every line They may be CONSISTENT: all TRUE on at least one line (in at least one case; under at least one set of circumstances) They may be INCONSISTENT: never all TRUE under any set of circumstances

  30. Truth tables define the logical operators They exhibit logical properties of statements: contingent; tautology; self-contradiction They exhibit logical relations between statements: equivalent contradiction consistent inconsistent And they let us test arguments for VALIDITY

  31. what is validity? The property of : it being impossible for a false conclusion to follow from true premises

  32. what is invalidity? The property of: IT BEING POSSIBLE FOR A FALSE CONCLUSION TO FOLLOW FROM TRUE PREMISES

  33. How to lay out a table for an argument Single slash “/” to separate premises Double slash “//” to set off the conclusion (far right)

  34. What does this table show? The possibility --or the impossibility-- of a False conclusion coming from True premises?

  35. p > q / p // q

  36. p > q / p // q

  37. p > q / p // q

  38. p v q / ~p // q

  39. p v q / ~p // q

  40. p v q / ~p // q Disjunctive Syllogism What is this called?

  41. p > q / q > r // p > r What is this called? Hypothetical Syllogism

  42. p > q / q > r // p > r

  43. Russell was either a realist or an empiricist. If the former, then he was not an idealist, so he was not an empiricist. R v E / R > ~I // ~ E

  44. Russell was either a realist or an empiricist. If the former, then he was not an idealist, so he was not an empiricist. R v E / R > ~I // ~ E

  45. Russell was either a realist or an empiricist. If the former, then he was not an idealist, so he was not an empiricist. R v E / R > ~I // ~ E

  46. If Sartre's an existentialist, then Wittgenstein wrote the Tractatus, therefore if Wittgenstein wrote the Tractatus, Sartre's an existentialist. S > W // W > S S > W // W > S

  47. If Sartre's an existentialist, then Wittgenstein wrote the Tractatus, therefore if Wittgenstein wrote the Tractatus, Sartre's an existentialist. S > W // W > S S > W // W > S

More Related