Truth Table For Critical Thinking
3.2 Truth Tables
A truth table lists all possible combinations of truth values. In a twovalued logic system, a single statement p has two possible truth values: truth (T) and falsehood (F). Given two statements p and q, there are four possible truth value combinations, that is, TT, TF, FT, FF. As a result, there are four rows in the truth table. With three statements, there are eight truth value combinations, ranging from TTT to FFF. In general, given n statements, there are 2^{n} rows (or cases) in the truth table.
p  p  q  p  q  r 
T  T  T  T  T  T 
F  T  F  T  T  F 
F  T  T  F  T  
F  F  T  F  F  
F  T  T  
F  T  F  
F  F  T  
F  F  F 
3.2.1 Basic Truth Tables of the Five Connectives
Formally, the following five basic truth tables define the five connectives.
The Truth Table of Negation
The possible truth values of a negation are opposite to the possible truth values of the statement it negates. If p is true, then ∼p is false. If p is false, then ∼p is true.
The Truth Table of Conjunction
A conjunction p•q is true only when both of its conjuncts are true. It is false in all other three cases.
p  q  p•q 
T  T  T 
T  F  F 
F  T  F 
F  F  F 
The Truth Table of Disjunction
A disjunction p∨q is false only when both of its disjuncts are false. In the other three cases, the disjunction is true.
p  q  p∨q 
T  T  T 
T  F  T 
F  T  T 
F  F  F 
The Truth Table of Conditional
A conditional is false only when its antecedent is true but its consequent is false. This is so because p⊃q says that p is a sufficient condition of q. Now if p is true but q is false, then p cannot be a sufficient condition for q. Consequently, the conditional p ⊃ q would be false.
p  q  p⊃q 
T  T  T 
T  F  F 
F  T  T 
F  F  T 
The Truth Table of Biconditional
A biconditional p≡q is true only when both p and q share the same truth value. If p and q have opposite truth values, then the biconditional is false.
p  q  p≡q 
T  T  T 
T  F  F 
F  T  F 
F  F  T 
3.2.2 Determining the Truth Value of a Compound Statement
The truth value of a compound statement is determined by the truth values of the simple statements it contains and the basic truth tables of the five connectives. In the following example,
the statements C and D are given as true, but E is given as false. To determine the truth value of the conditional, we first write down the given truth value under each letter. Afterwards, using the truth table of conjunction, we can determine the truth value of the antecedent C • D. Because both C and D are true, C • D is true. We then write down “T” under the dot “•” to indicate that C • D is true. Finally, since the antecedent C • D is true, but the consequent E is false, the conditional is false. The final truth value is written under the horseshoe “⊃”.
In the next example, the compound statement is a disjunction.
The statement H is given as true, but G and K false. To figure out the truth value of the disjunction, we need to first determine the truth value of the second disjunct ∼H ⊃ K. Since H is true, ∼H is false. We write down “F” under the tilde “∼”. Next, since the antecedent ∼H is false and the consequent K is false, the conditional ∼H ⊃ K is true. So we write down “T” under the horseshoe “⊃”. In the last step, we figure out that the disjunction is true because the first disjunct G is false but the second disjunct ∼H ⊃ K is true.
In the third example, we try to determine the truth value of a biconditional statement from the given truth values that A and D are true, but M and B are false.
Since M is false, but A is true, from the third row in the truth table of biconditional, we know that M ≡ A is false, and write down “F” under the triple bar “≡”. We then decide that D ⊃ B is false because D is true but B is false. Next we write down “T” under the tilde “∼” to indicate that ∼(M ≡ A) is true. Finally, we can see that the whole conjunction is false because the second conjunct is false.
3.2.3 Three Properties of Statement
In Propositional Logic, a statement is tautologous, selfcontradictory or contingent. Which property it has is determined by its possible truth values.
Tautology
A statement is tautologous if it is logically true, that is, if it is logically impossible for the statement to be false. If we look at the truth table of a tautology, we would see that all its possible truth values are Ts. One of the simplest tautology is a disjunction such as D ∨∼D.
To see all the possible truth values of D ∨∼D, we construct its truth table by first listing all the possible truth values of the statement D under the letter “D”. Next, we derive the truth values in the green column under the tilde “∼” from the column under the second “D”. The tilde column highlighted in green lists all the possible truth values of ∼D. Finally, from the column under the first “D” and the tilde column, we can come up with all the possible truth values of D ∨∼D. They are highlighted in red color, and since the red column under the wedge “∨” lists all the possible truth values of D ∨∼D, we put a border around it to indicate that it is the final (or main) column in the truth table. Notice that the two possible truth values in this column are Ts. Since the truth table lists all the possible truth values, it shows that it is logically impossible for D ∨∼D to be false. Accordingly, it is a tautology.
The next tautology K ⊃(N ⊃ K) has two different letters: “K” and “N”. So its truth table has four (2^{2} = 4) rows.
To construct the table, we put down the letter “T” twice and then the letter “F” twice under the first letter from the left, the letter “K”. As a result, we have “TTFF” under the first “K” from the left. We then repeat the column for the second “K”. Under “N”, the second letter from the left, we write down one “T” and then one “F” in turn until the column is completed. This results in having “TFTF” under “N”. Next, we come up with the possible truth values for N ⊃ K since it is inside the parentheses. The column is highlighted in green. Afterwards, we derive the truth values for the first horseshoe (here highlighted in red) based on the truth values in the first K column and the second horseshoe column (i.e., the green column). Finally we put a border around the first horseshoe column to show it is the final column. We see that all the truth values in that column are all Ts. So K ⊃(N ⊃ K) is a tautology.
Selfcontradiction
A statement is selfcontradictory if it is logically false, that is, if it is logically impossible for the statement to be true. After completing the truth table of the conjunction D • ∼D, we see that all the truth values in the main column under the dot are Fs. The truth table illustrates clearly that it is logically impossible for D • ∼D to be true.
The conjunction G •∼(H ⊃ G) has two distinct letters “G” and “H”, so its truth table has four rows.
We write down “TTFF” under the first “G” from the left, and then repeat the values under the second “G”. Under “H”, we put down “TFTF”. We then derive the truth values under the horseshoe from the H column and the second G column. Next, all the possible truth values for ∼(H ⊃ G) are listed under the tilde (highlighted in blue). Notice they are opposite to the truth values in the horseshoe column. Afterwards, we use the first G column and the tilde column to come up with the truth values listed under the dot. Since they are all Fs, G • ∼(H ⊃ G) is a selfcontradiction.
Contingent Statements
A statement is contingent if it is neither tautologous nor selfcontradictory. In other words, it is logically possible for the statement to be true and it is also logically possible for it to be false. The conditional D ⊃ ∼D is contingent because its final column contains both a T and a F. Since each row in the truth table represents one logical possibility, this shows that it is logically possible for D ⊃ ∼D to be true, as well as for it to be false.
In constructing the truth table for B ≡(∼E ⊃ B), we need to first come up with the truth values for ∼E because it is the antecedent of the conditional ∼E ⊃ B inside the parentheses. We then use the truth values under the tilde and the second “B” to derive the truth values for the horseshoe column. Next we come up with the column under the triple bar from the first B column and the horseshoe column. The final column has three Ts, representing the logical possibility of being true, and one F, representing the logical possibility of being false. Since its main column contains both T and F, B ≡(∼E ⊃ B) is contingent.
3.2.4 Relations between Two Statements
By comparing all the possible truth values of two statements, we can determine which of the following logical relations exists between them: logical equivalence, contradiction, consistency and inconsistency.
Logical Equivalence
Two statements are logically equivalent if they necessarily have the same truth value. This means that their possible truth values listed in the two final columns are the same in each row.
To see whether the pair of statements K ⊃ H and ∼H ⊃∼K are logically equivalent to each other, we construct a truth table for each statement.
Notice in both truth tables, the statement K has the truth value distribution TTFF, and H has the truth value distribution TFTF. This is crucial because we need to make sure that we are dealing with the same truth value distributions in each row. For instance, in the third row, K is false but H is true in both truth tables. After we complete both truth tables, we see that the two main (or final) columns are identical to each other. This shows that the two statements are logically equivalent.
It is important to be able to tell whether two English sentences are logically equivalent. To see whether these two statements
 The stock market will fall if interest rates are raised.
 The stock market won’t fall only if interest rates are not raised.
are logically equivalent, we first symbolize them as R ⊃ F and ∼F ⊃∼R. We then construct their truth tables.
Since the final two columns are identical, indeed they are logically equivalent.
Contradiction
Two statements are contradictory to each other if they necessarily have the opposite truth values. This means that their truth values in the final columns are opposite in every row of the truth tables. After completing the truth tables for D ⊃ B and D •∼B, we can see clearly from the two final columns that they are contradictory to each other.
Consistency
Two statements are consistent if it is logically possible for both of them to be true. This means that there is at least one row in which the truth values in both the final columns are true.
To find out whether ∼A •∼R and ∼(R • A) are consistent with each other, we construct their truth tables below.
Notice again that we have to write down “TTFF” under both “A”, and then “TFTF” under both “R”. After both truth tables are completed, we can see that in the fourth row of the final column each statement has T as its truth value. Since each row stands for a logical possibility, this means that it is logically possible for both of them to be true. So they are consistent with each other.
If we cannot find at least one row in which the truth values in both the final columns are true, then the two statements are inconsistent. That is, it is not logically possible for both of them to be true. In other words, at least one of them must be false. Therefore, if it comes to our attention that two statements are inconsistent, then we must reject at least one of them as false. Failure to do so would mean being illogical.
In the final columns of the truth tables of M • S and ∼(M ≡ S), we do not find a row in which both statements are true. This shows that they are inconsistent with each other, and at least one of them must be false.
There can be more than one logical relation between two statements. If two statements are contradictory to each other, then they would have opposite truth values in every row of the main columns. As a result, there cannot be a row in which both statements are true. This means that they must also be inconsistent to each other. However, if two statements are inconsistent, it does not follow that they must be contradictory to each other. The above pair, M • S and ∼(M ≡ S) are inconsistent, but not contradictory to each other. The last row of the two final columns shows that it is logically possible for both statements to be false.
For logically equivalent statements to be consistent with one another, they have to meet the condition that none of them is a selfcontradictory statement. The final column of a selfcontradictory statement contains no T. So it is not logically possible for a pair of selfcontradictory statements to be consistent with each other.
3.2.5 Truth Tables for Arguments
A deductive argument is valid if its conclusion necessarily follows from its premises. That is, if the premises are true, then the conclusion must be true. This means that if it is logically possible for the premises to be true but the conclusion false, then the argument is invalid. Since a truth table lists all logical possibilities, we can use it to determine whether a deductive argument is valid. The whole process has three steps:
 Symbolize the deductive argument;
 Construct the truth table for the argument;
 Determine the validity—look to see if there is at least one row in the truth table in which the premises are true but the conclusion false. If such a row is found, this would mean that it is logically possible for the premises to be true but the conclusion false. Accordingly, the argument is invalid. If such a row is not found, this would mean that it is not logically possible to have true premises with a false conclusion. Therefore, the argument is valid.
To decide whether the argument
If young people don’t have good economic opportunities, there would be more gang violence. Since there is more gang violence, young people don’t have good economic opportunities.  3.2a 
is valid, we first symbolize each statement to come up with the argument form. Next, we line up the three statements horizontally, separating the two premises with a single vertical line, and the premises and the conclusion with a double vertical line.
Afterwards, we write down “TTFF” under “O” and “TFTF” under “V”. We then derive the truth values for ∼O. Next, we complete the column under the horseshoe and put a border around it. We then complete the column for the second premise V and the conclusion ∼O. The three columns with borders list all the possible truth values for the three statements. To determine the validity of (3.2a), we go over the three main columns row by row to see whether there is a row in which the premises are true, but the conclusion false. We find such a case in the first row. This means that it is logically possible for the premises to be true, but the conclusion false. So (3.2a) is invalid.
To determine whether Argument (3.2b) is valid, we check the three final columns row by row to see if there is a row in which the premises are true but the conclusion false. We do not find such a row. So (3.2b) is valid.
Psychics can foretell the future only if the future has been determined. But the future has not been determined. It follows that psychics cannot foretell the future.  3.2b 
In the next example, there are three different letters in the argument form of (3.2c). So its truth table has eight (2^{3} = 8) rows. To exhaust all possible truth value combinations, we write down “TTTTFFFF” under the first letter from the left, “E”. For the second letter from the left, “F”, we put down “TTFFTTFF”, and for the third, “P”, “TFTFTFTF”. For the first premise, we first come up with the truth value for F • P and write down the truth values under the dot. We then derive the truth values under the horseshoe using the first E column and the dot column. Next, we fill out the columns for ∼E and ∼P. After the truth table is completed, we go over the three main columns to see if there is at least one row with true premises but a false conclusion. We find such a case in the fifth and the seventh rows. So the argument is invalid.
Public education will improve only if funding for education is increased and parents are more involved in the education process. Since public education is not improving, we can conclude that there is not enough parental involvement in the education process.  3.2c 
Notice the next argument (3.2d) has three premises. After symbolization, its argument form contains three different letters. So its truth table has eight rows. After completing the truth table, we check each row of the four final columns, looking for rows with true premises but a false conclusion. We do not find any. So (3.2d) is valid.
If more money is spent on building prisons, then less money would go to education. But kids would not be welleducated if less money goes to education. We have spent more money building prisons. As a result, kids would not be welleducated.  3.2d 
Exercise 3.2
 Determine the truthvalues of the following symbolized statements. Let A, B, and C be true; G, H, and K, false; M and N, unknown truthvalue. You need to show how you determine the truthvalue step by step.
 A •∼G
 ∼A ∨ G
 ∼(A ⊃ G)
 ∼G ≡(B ⊃ K)
 (A ⊃∼C)∨ C
 B •(∼H ⊃ A)
 M ⊃∼G
 (M ∨∼A)∨ H
 (N •∼N)≡∼K
 ∼(M ∨∼M)⊃ N
 Use the truth table to decide whether each of the following symbolized statements is tautologous, selfcontradictory or contingent.
 ∼G ⊃ G
 D ⊃(B ∨∼B)
 K • (∼M ∨∼K)
 (S ⊃ H)≡(∼H • S)
 (R ⊃ E)∨∼H
 (N •∼(D ∨∼E))≡ D
 Use truth tables to determine whether each pair of statements are logically equivalent, contradictory, consistent or inconsistent. If necessary, symbolize the statements. Identify all the relations between the statements.
 G •∼D
D ∨∼G  ∼(M ⊃ B)
∼B •∼M  ∼A ≡ C
(A •∼C)∨(C •∼A)  J ⊃∼(L ∨ N)
(∼L ⊃ N)• J  ∼((E ⊃ K)•∼O)
O ∨(E •∼K)  ∼(H ∨∼(R • S))
(∼S • R)⊃∼H  If Steve does not support you, then he is not your friend. (S, F)
If Steve supports you, then he is your friend. (S, F)  If someone loves you, then she or he is nice to you. (L, N)
If someone is nice to you, then she or he loves you. (N, L)  Without campaign finance reform people would not have equal access to political power. (C, E)
With campaign finance reform people would have equal access to political power. (C, E)  The economy will slow down unless consumer confidence stays high and inflation is under control. (S, H, U)
The economy will slow down if consumer confidence does not stay high and inflation is not under control. (S, H, U)
 Symbolize the arguments and then use the truth table to decide whether they are valid.
 Not both the music program and the art curriculum will be cut. So if the music program is not cut, then the art curriculum will. (M, A)
 Retailers cannot have a good holiday season unless the consumer confidence in the economy is high. Currently the consumer confidence in the economy is high. We can predict that retailers can have a good holiday season. (R, C)
 If nations do not cut back the use of fossil fuel, then worldwide pollution will get worse. Nations are cutting back the use of fossil fuel. Therefore, worldwide pollution will not get worse. (C, W)
 People would not demand cultural assimilation if they embrace diversity. However, people do demand cultural assimilation. Consequently, they do not embrace diversity. (A, D)
 We can have world peace only if people are compassionate and not prejudiced. Since people are prejudiced; therefore, we cannot have world peace. (W, C, P)
 Germline genetic engineering should be banned if we do not want to have designer babies. If we want to have designer babies, there would be greater social inequality. So either germline genetic engineering should be banned or there would be greater social inequality. (G, D, I)
 The economy will suffer if we fall behind other nations in science, technology and innovation. If we do not improve mathematics education, we will fall behind other nations in science, technology and innovation. Therefore, the economy will suffer unless we improve mathematics education. (S, F, I)
 If we continue the acceleration of production and consumption, nations will fight over natural resources unless alternative technologies are developed. Since we are developing alternative technologies, nations won’t fight over natural resources. (C, F, D)
This work is licensed under a Creative Commons AttributionNoncommercialNo Derivative Works 3.0 United States License.
§1. What are we doing?
In this tutorial you will learn how to draw full (or complete) truthtables for more complex WFFs. What we want to do is to use a truthtable to tell us when a WFF is true and when it is false. Here is an analogy to help you understand what it is that we want to do.
Suppose we have two arrows and they can only point either up or down. Then there are only four different possible ways they can be aligned:
Now consider the sentence "the left arrow is pointing up and the right arrow is pointing up". Obviously, the sentence is true in the first situation, and false in the other three situations. If we consider a different sentence, such as "the right arrow is pointing down", then it is true in the second and fourth situation. Finally, what about a sentence such as "the left arrow is point up and the left arrow is pointing down"? This is an inconsistent statement, and clearly it is false in all four situations.
Similarly, when we draw a truthtable for a WFF in SL, we are trying to list a set of possible situations to determine when the WFF is true (if ever) and when it is false (if ever).
§2. Drawing a truthtable
To draw a truthtable for a WFF, follow the following procedure. First, remember that there are four regions in a full truthtable:
Region #1  
Region #3

Region #4

To complete the truthtable for a WFF, you need to fill in the four regions according to this procedure:
Step 1
Write down the WFF in region #2.
Step 2
Identify the sentence letters that appear in the WFF, and write them down one after the other on a single row in region #1. You only need to write down a sentence letter once even if it has more than one occurrences in the WFF.
So for example, given the WFF "(P→(PvQ))", the truthtable would look like this after the first two steps:
Region #3

Region #4

Step 3
Region 3 is a list of all possible combination of truthvalues that the sentence letters in region #1 can take. Each row in region #3 specifies a combination, and each combination is called an assignment of truthvalues. These assignments correspond to the different possible situations in the arrow example at the top.
If there are n sentence letters in region #1, each of which can have the truthvalue T or F, then we know that there are 2^{n} possible assignments of truthvalues (2^{1}=2, 2^{2}=4, 2^{3}=8, 2^{4}=16, etc.). So in the truthtable above, there should be four assignments. We write them down one on each row in region #3:
T F F T F F 
On each row, we write down under each sentence letter a truthvalue which is the truthvalue that the sentence letter receives under that assignment. So "T F" on the second row indicates an assignment where "P" is T and "Q" is F, and "F T" on the third row indicates an assignment where "P" is F and "Q" is T.
In writing down the assignments it is important to use a systematic method to list all of them. Without such a method it is easy to miss some of them if there are many rows in the truthtable. When you compare the truthtables of two or more WFFs, it is important to use the same method to list the truthvalue assignments in the same order.
The standard method is as follows: Start with the rightmost sentence letter in region #1. Write "T" down under the letter on the first row of region #3, and then "F" on the second row, alternating for every row until the last row. Then move on to the second sentence letter, and again start with "T". But this time alternate the truthvalue only every two rows. If there is a third sentence letter, alternate between "T"s and "F"s every four rows. In general then, for the nth sentence letter (starting from the right hand side), alternate between "T"s and "F"s every 2^{n1} row.
Step 4
The remaining task in completing the truthtable is to fill in region #4 by calculating the truthvalue of the WFF under each assignment.
First, let us define the length of a WFF as the number of symbols of SL it contains. Each occurrence of a connective or sentence letter counts as a single symbol, and the open and close brackets are different symbols. So "P" has length 1, "~~Q" has length 3, and "((P&Q)→R)" has length 9 (not 10).
We then apply this procedure. First, write down beneath each sentence letter of the WFF the truthvalue it has under each assignment:
T F F T F F  T T F F F T F F F 
Sentence letters are of course WFFs of length 1. We then look for the next shortest WFFs which are part of the whole WFF, and calculate their truthvalues under each assignment. The next shortest WFFs should be of length 2, such as "~Q", but since there are no such WFFs, the next shortest WFF is "(PvQ)" of length 5. We write down its truthvalue for each assignment under its main operator. Remember that the main operator of a WFF is the occurrence of a connective that has the widest scope.
T F F T F F  T TTF F FTT F FFF 
We then repeat this procedure with the next shortest WFF until we are finished with the whole WFF:
T F F T F F  T T TTF F T FTT F T FFF 
The last column of truthvalue we write down indicates the truthvalues of the whole WFF under each of the assignments. This particular truthtable we have completed shows that the WFF is true under all the four possible assignments.
If you can mentally carry out calculations of truthvalues quickly, you can leave out writing the truthvalues of the parts of WFF and just write down the truthvalue of the whole WFF under each assignment. Then you will end up with this truthtable.
T F F T F F  T T T 
§3. Brackets
Now that you know how to construct complex truthtables, you can see why brackets are necessary. For example, “(A&B→C)” is ambiguous as between “((A&B)→C)” and “(A&(B→C))”. The truthtables of the two WFFs are very different though :
A  B  C  ((A&B)→C) 
T  T  T  T 
T  T  F  F 
T  F  T  T 
T  F  F  T 
F  T  T  T 
F  T  F  T 
F  F  T  T 
F  F  F  T 
A  B  C  (A&(B→C)) 
T  T  T  T 
T  T  F  F 
T  F  T  T 
T  F  F  T 
F  T  T  F 
F  T  F  F 
F  F  T  F 
F  F  F  F 
Of course there are cases where the brackets do not matter. For example, it should be obvious that with “P&Q&R&S”, no matter where you place the brackets to turn it into a WFF, the resulting truthtable is always the same.
previous tutorial next tutorial
One thought on “Truth Table For Critical Thinking”