2.3: Constructing Truth Tables
After completing this section, you should be able to:
- Interpret and apply negations, conjunctions, and disjunctions.
- Construct a truth table using negations, conjunctions, and disjunctions.
- Construct a truth table for a compound statement and interpret its validity.
Are you familiar with the Choose Your Own Adventure book series written by Edward Packard? These gamebooks allow the reader to become one of the characters and make decisions that affect what happens next, resulting in different sequences of events in the story and endings based on the choices made. Writing a computer program is a little like what it must be like to write one of these books. The programmer must consider all the possible inputs that a user can put into the program and decide what will happen in each case, then write their program to account for each of these possible outcomes.
A truth table is a graphical tool used to analyze all the possible truth values of the component logical statements to determine the validity of a statement or argument along with all its possible outcomes. The rows of the table correspond to each possible outcome for the given logical statement identified at the top of each column. A single logical statement has two possible truth values, true or false. In truth tables, a capital T will represent true values, and a capital F will represent false values.
In this section, you will use the knowledge built in Statements and Quantifiers and Compound Statements to analyze arguments and determine their truth value and validity. A logical argument is valid if its conclusion follows from its premises, regardless of whether those premises are true or false. You will then explore the truth tables for negation, conjunction, and disjunction, and use these truth tables to analyze compound logical statements containing these connectives.
Interpret and Apply Negations, Conjunctions, and Disjunctions
The negation of a statement will have the opposite truth value of the original statement. When is true, is false, and when is false, is true.
For each logical statement, determine the truth value of its negation.
- :
- : All horses are mustangs.
- : New Delhi is not the capital of India.
- Answer
-
p is true because 3 + 5 does equal 8; therefore, the negation of p, ~ p : 3 + 5 ≠ 8 ~ p : 3 + 5 ≠ 8 , is false.
q is false because there are other types of horses besides mustangs, such as Clydesdales or Arabians; therefore, the negation of q , ~ q , is true.
~ r is false because New Delhi is the capital of India; therefore, the negation of ~r, r , is true.
For each logical statement, determine the truth value of its negation.
- \(\text~p\) : \(3 \times 5 = 14\).
- \(\text~q\) : Some houses are built with bricks
- \(r\) : Abuja is the capital of Nigeria.
A conjunction is a logical and statement. For a conjunction to be true, both statements that make up the conjunction must be true. If at least one of the statements is false, the and statement is false.
1. \(p \wedge q\)
2. \(\sim q \wedge r\)
3. \(\sim p \wedge q\)
-
Answer
-
1. \(p\) is true, and \(q\) is false. Because one statement is true, and the other statement is false, this makes the complete conjunction false.
2. \(q\) is false, so \(\sim q\) is true, and \(r\) is true. Therefore, both statements are true, making the complete conjunction true.
3. \(\sim p\) is false, and \(q\) is false. Because both statements are false, the complete conjunction is false.
1. \(p\) is true, and \(q\) is false. Because one statement is true, and the other statement is false, this makes the complete conjunction false.
2. \(q\) is false, so \(\sim q\) is true, and \(r\) is true. Therefore, both statements are true, making the complete conjunction true.
3. \(\sim p\) is false, and \(q\) is false. Because both statements are false, the complete conjunction is false.
Given \(p\) : Yellow is a primary color, \(q\) : Blue is a primary color, and \(r\) : Green is a primary color, determine the truth value of each conjunction.
1. \(p \wedge q\)
2. \(q \wedge r\)
3. \(\sim r \wedge p\).
The only time a conjunction is true is if both statements that make up the conjunction are true.
A disjunction is a logical inclusive or statement, which means that a disjunction is true if one or both statements that form it are true. The only way a logical inclusive or statement is false is if both statements that form the disjunction are false.
1. \(p \vee q\)
2. \(\sim q \vee r\)
3. \(\sim p \vee q\)
-
Answer
-
-
\(p\) is true, and \(q\) is false. One statement is true, and one statement is false, which makes the complete disjunction true.
-
\(q\) is false, so \(\sim q\) is true, and \(r\) is true. Therefore, one statement is true, and the other statement is true, which makes the complete disjunction true.
-
\(\sim p\) is false, and \(q\) is false. When all of the component statements are false, the disjunction is false.
2. \(\sim q \vee r\)
3. \(\sim p \vee q\)
- \(p\) is true, and \(q\) is false. One statement is true, and one statement is false, which makes the complete disjunction true.
- \(q\) is false, so \(\sim q\) is true, and \(r\) is true. Therefore, one statement is true, and the other statement is true, which makes the complete disjunction true.
- \(\sim p\) is false, and \(q\) is false. When all of the component statements are false, the disjunction is false.
Given \(p\) : Yellow is a primary color, \(q\) : Blue is a primary color, and \(r\) : Green is a primary color, determine the truth value of each disjunction.
1. \(p \vee q\)
2. \(\sim p \vee r\)
3. \(q \vee r\)
In the next example, you will apply the dominance of connectives to find the truth values of compound statements containing negations, conjunctions, and disjunctions and use a table to record the results. When constructing a truth table to analyze an argument where you can determine the truth value of each component statement, the strategy is to create a table with two rows. The first row contains the symbols representing the components that make up the compound statement. The second row contains the truth values of each component below its symbol. Include as many columns as necessary to represent the value of each compound statement. The last column includes the complete compound statement with its truth value below it.
1. \(\sim p \wedge q \vee r\)
2. \(\sim p \vee q \wedge r\)
3. \(\sim(p \wedge r) \vee q\)
-
Answer
-
1.
Step 1:
The statement " \(\sim p \wedge q \vee r\) " contains three basic logical statements, \(p, q\), and \(r\), and three connectives, \(\sim, \wedge, \vee\). When we place parentheses in the statement to indicate the dominance of connectives, the statement becomes \((((\sim p) \wedge q) \vee r)\).
Step 2:
After we have applied the dominance of connectives, we create a two row table that includes a column for each basic statement that makes up the compound statement, and an additional column for the contents of each parentheses. Because we have three sets of parentheses, we include a column for \(\sim p\), the innermost parentheses, a column for \((\sim p) \wedge q\), the next set of parentheses, and \(((\sim p) \wedge q) \vee r\) in the last column for the third parentheses.
Step 3:
Once the table is created, we determine the truth value of each statement starting from left to right. The truth values of \(p, q\), and \(r\) are true, false, and true, respectively, so we place T, F, and \(\mathrm{T}\) in the second row of the table. Because \(p\) is true, \(\sim p\) is false.
Step 4:
Next, evaluate \(\sim p \wedge q\) from the table: \(\sim p\) is false, and \(q\) is also false, so \(\sim p \wedge q\) is false, because a conjunction is only true if both of the statements that make it are true. Place an \(\mathrm{F}\) in the table below its heading.
Step 5:
Finally, using the table, we understand that \((\sim p \wedge q)\) is false and \(r\) is true, so the complete statement \((\sim p \wedge q) \vee r\) is false or true, which is true (because a disjunction is true whenever at least one of the statements that make it is true). Place a \(\mathrm{T}\) in the last column of the table. The complete statement \(\sim p \wedge q \vee r\) is true.
p
q
r
-p
(~p)∧q
((~p)∧q)∨r
T
F
T
F
F
T
2.
Step 1
: Applying the dominance of connectives to the original compound statement \(\sim p \vee q \wedge r\), we get \((((\sim p) \vee q) \wedge r)\).
Step 2
: The table needs columns for \(p, q, r, \sim p,(\sim p) \vee q\), and \(((\sim p) \vee q) \wedge r\).
Step 3
:The truth values of \(p, q, r\), and \(\sim p\) are the same as in Question 1.
Step 4
: Next, \(\sim p \vee q\) is false or false, which is false, so we place an \(\mathrm{F}\) below this statement in the table. This is the only time that a disjunction is false.
Step 5
: Finally, \(\sim p \vee q\) and \(r\) are the conjunction of the statements, \(\sim p \vee q\) and \(r\), and so the expressions evaluate to false and true, which is false. Recall that the only time an "and" statement is true is when both statements that form it are also true. The complete statement \(\sim p \vee q \wedge r\) is false.
p
q
r
-p
(~p)∧q
((~p)∧q)∨r
T
F
T
F
F
F
3.
Step 1
: Applying the dominance of connectives to the original statement, we have: \(((\sim(p \wedge r)) \vee q)\).
Step 2
: So, the table needs the following columns: \(p, q, r, p \wedge r, \sim(p \wedge r)\), and \(\sim(p \wedge r) \vee q\).
Step 3
: The truth values of \(p, q\), and \(r\) are the same as in Questions 1 and 2.
Step 4
: From the table it can be seen that \(p \wedge r\) is true and true, which is true. So the negation of \(p\) and \(r\) is false, because the negation of a statement always has the opposite truth value of the original statement.
Step 5
: Finally, \(\sim(p \wedge r) \vee q\) is the disjunction of \(\sim(p \wedge r)\) with \(q\), and so we have false or false, which makes the complete statement false.
p
q
r
-p
(~p)∧q
((~p)∧q)∨r
T
F
T
T
F
F
2. \(\sim p \vee q \wedge r\)
3. \(\sim(p \wedge r) \vee q\)
1.
Step 1:
The statement " \(\sim p \wedge q \vee r\) " contains three basic logical statements, \(p, q\), and \(r\), and three connectives, \(\sim, \wedge, \vee\). When we place parentheses in the statement to indicate the dominance of connectives, the statement becomes \((((\sim p) \wedge q) \vee r)\).
Step 2:
After we have applied the dominance of connectives, we create a two row table that includes a column for each basic statement that makes up the compound statement, and an additional column for the contents of each parentheses. Because we have three sets of parentheses, we include a column for \(\sim p\), the innermost parentheses, a column for \((\sim p) \wedge q\), the next set of parentheses, and \(((\sim p) \wedge q) \vee r\) in the last column for the third parentheses.
Step 3:
Once the table is created, we determine the truth value of each statement starting from left to right. The truth values of \(p, q\), and \(r\) are true, false, and true, respectively, so we place T, F, and \(\mathrm{T}\) in the second row of the table. Because \(p\) is true, \(\sim p\) is false.
Step 4:
Next, evaluate \(\sim p \wedge q\) from the table: \(\sim p\) is false, and \(q\) is also false, so \(\sim p \wedge q\) is false, because a conjunction is only true if both of the statements that make it are true. Place an \(\mathrm{F}\) in the table below its heading.
Step 5:
Finally, using the table, we understand that \((\sim p \wedge q)\) is false and \(r\) is true, so the complete statement \((\sim p \wedge q) \vee r\) is false or true, which is true (because a disjunction is true whenever at least one of the statements that make it is true). Place a \(\mathrm{T}\) in the last column of the table. The complete statement \(\sim p \wedge q \vee r\) is true.
| p | q | r | -p | (~p)∧q | ((~p)∧q)∨r |
|---|---|---|---|---|---|
| T | F | T | F | F | T |
2.
Step 1
: Applying the dominance of connectives to the original compound statement \(\sim p \vee q \wedge r\), we get \((((\sim p) \vee q) \wedge r)\).
Step 2
: The table needs columns for \(p, q, r, \sim p,(\sim p) \vee q\), and \(((\sim p) \vee q) \wedge r\).
Step 3
:The truth values of \(p, q, r\), and \(\sim p\) are the same as in Question 1.
Step 4
: Next, \(\sim p \vee q\) is false or false, which is false, so we place an \(\mathrm{F}\) below this statement in the table. This is the only time that a disjunction is false.
Step 5
: Finally, \(\sim p \vee q\) and \(r\) are the conjunction of the statements, \(\sim p \vee q\) and \(r\), and so the expressions evaluate to false and true, which is false. Recall that the only time an "and" statement is true is when both statements that form it are also true. The complete statement \(\sim p \vee q \wedge r\) is false.
| p | q | r | -p | (~p)∧q | ((~p)∧q)∨r |
|---|---|---|---|---|---|
| T | F | T | F | F | F |
3.
Step 1
: Applying the dominance of connectives to the original statement, we have: \(((\sim(p \wedge r)) \vee q)\).
Step 2
: So, the table needs the following columns: \(p, q, r, p \wedge r, \sim(p \wedge r)\), and \(\sim(p \wedge r) \vee q\).
Step 3
: The truth values of \(p, q\), and \(r\) are the same as in Questions 1 and 2.
Step 4
: From the table it can be seen that \(p \wedge r\) is true and true, which is true. So the negation of \(p\) and \(r\) is false, because the negation of a statement always has the opposite truth value of the original statement.
Step 5
: Finally, \(\sim(p \wedge r) \vee q\) is the disjunction of \(\sim(p \wedge r)\) with \(q\), and so we have false or false, which makes the complete statement false.
| p | q | r | -p | (~p)∧q | ((~p)∧q)∨r |
|---|---|---|---|---|---|
| T | F | T | T | F | F |
Given \(p\) : Yellow is a primary color, \(q\) : Blue is a primary color, and \(r\) : Green is a primary color, determine the truth value of each compound statement, by constructing a truth table.
1. \(\sim q \wedge p \vee r\)
2. \(p \vee q \wedge \sim r\)
3. \(\sim(p \wedge r) \wedge q\)
Construct Truth Tables to Analyze All Possible Outcomes
Recall from Statements and Questions that the negation of a statement will always have the opposite truth value of the original statement; if a statement is false, then its negation is true, and if a statement is true, then its negation is false. To create a truth table for the negation of statement , add a column with a heading of , and for each row, input the truth value with the opposite value of the value listed in the column for , as depicted in the table below.
| Negation | |
|---|---|
| p | ~ p |
| T | F |
| F | T |
Conjunctions and disjunctions are compound statements formed when two logical statements combine with the connectives “and” and “or” respectively. How does that change the number of possible outcomes and thus determine the number of rows in our truth table? The multiplication principle , also known as the fundamental counting principle , states that the number of ways you can select an item from a group of items and another item from a group with items is equal to the product of and . Because each proposition and has two possible outcomes, true or false, the multiplication principle states that there will be possible outcomes: {TT, TF, FT, FF}.
The tree diagram and table in Figure \(\PageIndex{2}\) demonstrate the four possible outcomes for two propositions and .
A conjunction is a logical and statement. For a conjunction to be true, both the statements that make up the conjunction must be true. If at least one of the statements is false, the and statement is false.
A disjunction is a logical inclusive or statement. Which means that a disjunction is true if one or both statements that make it are true. The only way a logical inclusive or statement is false is if both statements that make up the disjunction are false.
| Conjunction (AND) | Disjunction (OR) | |||||
|---|---|---|---|---|---|---|
| T | T | T | T | T | T | |
| T | F | F | T | F | T | |
| F | T | F | F | T | T | |
| F | F | F | F | F | F |
Construct a truth table to analyze all possible outcomes for each of the following arguments.
1. \(p \vee \sim q\)
2. \(\sim(p \wedge q)\)
3. \((p \vee \sim q) \wedge r\)
- Answer
-
1. Step 1 : Because there are two basic statements, \(p\) and \(q\), and each of these has two possible outcomes, we will have \(2(2)=4\) rows in our table to represent all possible outcomes: TT, TF, \(\mathrm{FT}\), and FF. The columns will include \(p, q, \sim q\), and \(p \vee \sim q\).
Step 2: Every value in column \(\sim q\) will have the opposite truth value of the corresponding value in column \(q\) : F, T, F, and T.
Step 3: To complete the last column, evaluate each element in column \(p\) with the corresponding element in column \(\sim q\) using the connective or.p q \(\sim q\) \(p \vee \sim q\). T T F T T F T T F T F F F F T T 2. Step 1: The columns will include \(p, q, p \wedge q\), and \(\sim(p \wedge q)\). Because there are two basic statements, \(p\) and \(q\), the table will have four rows to account for all possible outcomes.
Step 2 : The \(p \wedge q\) column will be completed by evaluating the corresponding elements in columns \(p\) and \(q\) respectively with the and connective.
Step 3 : The final column, \(\sim(p \wedge q)\), will be the negation of the \(p \wedge q\) column.p q \(p \wedge q\) \(\sim(p \wedge q)\) T T T F T F F T F T F T F F F T 3. Step 1: This statement has three basic statements, \(p, q\), and \(r\). Because each basic statement has two possible truth values, true or false, the multiplication principal indicates there are \(2(2)(2)=8\) possible outcomes. So eight rows of outcomes are needed in the truth table to account for each possibility. Half of the eight possibilities must be true for the first statement, and half must be false.
Step 2: So, the first column for statement \(p\), will have four T's followed by four F's. In the second column for statement \(q\), when \(p\) is true, half the outcomes for \(q\) must be true and the other half must be false, and the same pattern will repeat for when \(p\) is false. So, column \(q\) will have TT, FF, FF, FF.Step 3: The column for the third statement, \(r\), must alternate between \(T\) and \(F\). Once, the three basic propositions are listed, you will need a column for \(\sim, p \vee \sim q\), and \((p \vee \sim q) \wedge r\).
Step 4: The column for the negation of \(q, \sim q\), will have the opposite truth value of each value in column \(q\).
Step 5: Next, fill in the truth values for the column containing the statement \(p \vee \sim q\). The or statement is true if at least one of \(p\) or \(\sim q\) is true, otherwise it is false.
Step 6: Finally, fill in the column containing the conjunction \((p \vee \sim q) \wedge r\). To evaluate this statement, combine column \(p \vee \sim q\) and column \(r\) with the and connective. Recall, that only time "and" is true is when both values are true, otherwise the statement is false. The complete truth table is:\(p\) \(q\) \(r\) \(\sim q\) \(p \vee \sim q\) \((p \vee \sim q) \wedge r\) T T T F T T T T F F T F T F T T T T T F F T T F F T T F F F F T F F F F F F T T T T F F F T T F
Construct a truth table to analyze all possible outcomes for each of the following arguments.
1. \(p \wedge \sim q\)
2. \(\sim(p \vee q)\)
3. \((p \wedge \sim q) \vee r\)
Determine the Validity of a Truth Table for a Compound Statement
A logical statement is valid if it is always true regardless of the truth values of its component parts. To test the validity of a compound statement, construct a truth table to analyze all possible outcomes. If the last column, representing the complete statement, contains only true values, the statement is valid.
Construct a truth table to determine the validity of each of the following statements.
1. \(\sim p \wedge q\)
2. \(\sim(p \wedge \sim p)\)
- Answer
-
1. Step 1 : Because there are two statements, \(p\) and \(q\), and each of these has two possible outcomes, there will be \(2(2)=4\) rows in our table to represent all possible outcomes: TT, TF, \(\mathrm{FT}\), and FF.
Step 2 : The columns, will include \(p, q, \sim p\) and \(\sim p \wedge q\). Every value in column \(\sim p\) will have the opposite truth value of the corresponding value in column \(p\).
Step 3: To complete the last column, evaluate each element in column \(\sim p\) with the corresponding element in column \(q\) using the connective and. The last column contains at least one false, therefore the statement \(\sim p \wedge q\) is not valid.\(p\) \(q\) \(\sim p\) \(\sim \boldsymbol{p} \wedge \boldsymbol{q}\) T T F F T F F F F T T T F F T F 2. Step 1 : Because the statement \(\sim(p \wedge \sim p)\) only contains one basic proposition, the truth table will only contain two rows. Statement \(p\) may be either true or false.
Step 2: The columns will include \(p, \sim p, p \wedge \sim p\), and \(\sim(p \wedge \sim p)\). Evaluate column \(p \wedge \sim p\) with the and connective, because the symbol \(\wedge\) represents a conjunction or logical and statement. True and false is false, and false and true is also false.
Step 3: The final column is the negation of each entry in the third column, both of which are false, so the negation of false is true. Because all the truth values in the final column are true, the statement \(\sim(p \wedge \sim p)\) is valid.\(p\) \(\sim p\) \(p \wedge \sim p\) \(\sim(p \wedge \sim p)\) T F F T F T F T
Construct a truth table to determine the validity of each of the following statements.
1. \(p \vee \sim p\)
2. \(\sim p \vee \sim q\)
Check Your Understanding
- A logical argument is _____ if its conclusion follows from its premises.
- A logical statement is valid if it is always _____.
- A _____ _____ is a tool used to analyze all the possible outcomes for a logical statement.
- The truth table for the conjunction, \(p \wedge q\), has _____ rows of truth values.
- The truth table for the negation of a logical statement, \(\text{~}p\), has _____ rows of truth values.