SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Truth Tables and Logic Statements: Negation, Conjunction, Disjunction

derrickfernandez avatar
derrickfernandez
15 diapositives · 286 Views · Jan 02, 2020

Learn how to construct truth tables for negation, conjunction, and disjunction statements with step-by-step examples and a general procedure guide.

Truth Tables and Logic Statements: Negation, Conjunction, Disjunction - slide 1
01 / 15Truth Tables and Logic Statements: Negation, Conjunction, Disjunction
1 / 17

Télécharger la présentation

Truth Tables and Logic Statements: Negation, Conjunction, Disjunction
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. 3.2 Truth Tables for Negation,Conjunction, and Disjunction

  2. Truth Table • A truth table is used to determine when a compound statement is true or false.

  3. p ~p Case 1 T F Case 2 F T Negation Truth Table

  4. Four case Truth table

  5. 8 case Truth table

  6. p q Case 1 T T T Case 2 T F F Case 3 F T F Case 4 F F F Conjunction Truth Table The conjunction is true only when bothp and q are true.

  7. p q Case 1 T T T Case 2 T F T Case 3 F T T Case 4 F F F Disjunction The disjunction is true when either p is true,q is true, or both p and q are true.

  8. General Procedure for Constructing Truth Tables 1. Determine if the statement is a negation, conjunction, disjunction, conditional, or biconditional. The answer to the truth table appears under: ~ if it is a negation ^ if it is a conjunction V if it is a disjunction g if it is conditional 1 if it is biconditional

  9. General Procedure for Constructing Truth Tables (continued) 2. Complete the columns under the simple statements, p, q, r, and their negations ~p, ~q, ~r, within parentheses, if present. If there are nested parentheses work with the innermost first. 3. Complete the column under the connective within parentheses, if present. You will use the truth values of the connective in determining the final answer in step 5. 4. Complete the column under any remaining statements and their negation.

  10. General Procedure for Constructing Truth Tables (continued) 5. Complete the column under any remaining connectives. Answer will appear under the column determined in step 1. For a conjunction, disjunction, conditional or biconditional, obtain the value using the last column completed on the left side and on the right side of the connective. For a negation, negate the values of the last column completed within the grouping symbols on the right of the negation. Number the columns in the order the were completed.

  11. Example: Truth Table with a Negation Construct a truth table for ~(~q ^p). Solution: Construct standard four case truth table. Then fill-in the table in order, as follows: T T F F T F T F T F T T F T F T F T F F T T F F 1 3 4 2

  12. Example: Truth Table with a Negation Construct a truth table for q v ~p. Solution: Construct standard four case truth table. Then fill-in the table in order, as follows: T T F F T F T F T F T F T F T T F F T T 1 3 2

  13. Example: construct a truth table for the statement (p ^ r) v q Column #3 is the answer to the parentheses. Use column #3 and #4 to find answer column #5 1 3 2 5 4

  14. Example: Determine the truth value if p is True, q is false and r is false. 1. (p v q) ^ ~r 2. ~(p ^ ~r) v q T T F T T F T T T F F 1 3 2 5 4 4 1 3 2 6 5 Notice in these problems we are only solving the problems for the one case proviede.

  15. Homework p. 114 # 6 – 66 (by 3)