3.3 Common Argument Forms

In the previous section we learned how to use truth tables to determine whether deductive arguments are valid. As arguments get longer, their truth tables would have more rows. Using truth tables to determine their validity can become quite time-consuming. For example, the truth table of the following argument has 16 rows, and can take quite a bit of time to construct.

If interest rates are raised, the stock market will be hurt. If the stock market is hurt, the economy will slow down. But if interest rates are not raised, inflation will get worse. If inflation gets worse, the economy will slow down. So the economy will slow down. 3.3a

Since using truth tables to determine validity can be tedious, there is an incentive to find a more efficient way.

Arguments such as (3.3a) are built by combining small and basic valid argument forms. This means that if we can recognize the small forms and see how they are put together to form longer arguments, then we can determine validity without constructing truth tables.

3.3.1 Basic Valid Forms

There are six basic forms that are commonly used:

  1. Disjunctive Syllogism (DS)
  2. Hypothetical Syllogism (HS)
  3. Modus Ponens (MP)
  4. Modus Tollens (MT)
  5. Constructive Dilemma (CD)
  6. Destructive Dilemma (DD)

We are going to study them and learn how to recognize them.

Disjunctive Syllogism (DS)

The basic form disjunctive syllogism gets its name from the feature that one of the two premises is a disjunction. The disjunction tells us that at least one of its disjuncts must be true in order for the disjunction to be true. Now since the other premise asserts that one of the disjuncts is false (that is, its negation is true). It follows that the other disjunct must be true.

    p q  

  p

  q

Notice that in Propositional Logic, the order of the premises does not matter. So the following two are treated as the same form.


  p q  

  ∼p

  p
=
  p q

  q


  q

We can prove that the form disjunctive syllogism is valid using the truth table. Use the play button button below to step through the proof.

After we know what the form looks like, the next step is to identify it from a written argument. Here is an example of disjunctive syllogism:

Either interest rates go up or inflation gets worse. Since interest rates have not gone up, we can be sure that inflation is getting worse. 3.3b

After symbolizing the argument as


  U W

  ∼U

  W

we can tell that it is an instance of disjunctive syllogism. In this way we can find out that it is valid without constructing its truth table.

Hypothetical Syllogism (HS)

A hypothetical syllogism has a distinct feature that helps us recognize it. The argument consists of three conditionals. The first conditional says that p is a sufficient condition for q. The second one says that q in turn is a sufficient condition for r. It would then follow that p is a sufficient condition for r.


  p q

  q r

  p r

The next argument

If more prisons are built, public education will get worse due to lack of funding. If public education gets worse due to lack of funding, there will be more criminals. As a result, if more prisons are built, there will be more criminals. 3.3c

has the form


  B  W

  W  C

  B  C

and thus is an instance of hypothetical syllogism.

Modus Ponens (MP)

“Modus ponens” is the Latin term for “affirmative mode.” We can also call it “affirming the antecedent” because one of its premises affirms that the antecedent of the conditional is true. It is a valid form based on the concept of sufficient condition. If p is a sufficient condition of q, and p is true, then q must be true.


  p q

  p

  q

Modus ponens is one of the most commonly used valid forms. Here is an example:

If Republicans favor free market economy, then they should oppose farm subsidies. Republicans favor free market economy. So they should oppose farm subsidies. 3.3d

The argument is symbolized as


  F O

  F

  O

We can see that its form is modus ponens and thus is valid.

Modus Tollens (MT)

“Modus tollens” means “denying mode” in Latin. Its English name is “denying the consequent” because one of its premises denies that the consequent of the conditional is true. The validity of modus tollens can be easily explained using the concept of necessary condition. If q is a necessary condition of p, and q is false, then p must be false.


  p q

  q

  p

The next argument is an example of modus tollens:

We should be against big corporations only if we are against their stock holders. We are not against the stock holders. So we should not be against big corporations. 3.3e

  B S

  S

  B

Constructive Dilemma (CD)

Constructive dilemma, like modus ponens, is built upon the concept of sufficient condition. The two conditionals p q and r s can be joined together as a conjunction or stated separately as two premises. They assert that p is a sufficient condition for q and r is a sufficient condition for s. Consequently, if at least one of the sufficient conditions is true, then at least one of the consequents must also be true.


  (p q) (r s)
or
  p q

  p r


  r s

  q s


  p r





  q s

After symbolizing the argument

If consumers increase spending, then inflation will get worse. If consumers cut back on spending, then there will be a recession. Consumers either increase or cut back on spending. It follows that the inflation will get worse or there will be a recession. 3.3f

as


  (I  W) (C R)

  I C

  W R

We can see that it is a constructive dilemma, and thus is valid.

A version of constructive dilemma has p p as one of the premises.


  (p q) (p s)  

  p p

  q s

Since p ∨ ∼p is a tautology, the argument is sound if the premise (p  q (p  s) is true. Here is an example of this commonly seen version of constructive dilemma:

With protectionism, prices for consumer goods would become higher. Without protectionism, jobs would be lost. Since we either adopt protectionism or reject it, prices for consumer goods would become higher or jobs would be lost. 3.3g

  (P H) (P J)

  P ∨ ∼P

  H J

Destructive Dilemma (DD)

Destructive dilemma is another common form based on the concept of necessary condition. The two conditionals assert that q is a necessary condition for p and s is a necessary condition for r. So if q is false or s is false, then it must be the case that p is false or r is false.


  (p q) (r s)
or
  p q

  q s


  r s

  p r


  q s





  p r

Here is an example of destructive dilemma:

Global warming can be slowed down only if we switch to cleaner energy sources. But the current level of industrial production can be sustained only if we continue to use fossil fuels. We won’t switch to cleaner energy sources or we won’t continue to use fossil fuels. As a result, global warming cannot be slowed down or the current level of industrial production cannot be sustained. 3.3h

  (G S) (P F)

  S F

  G P

It is also common to see a destructive dilemma with a tautologous disjunction as one of its premises:


  (p q) (r q)

  q q

  p r

The first conditional asserts that q is a necessary condition for p. This means that if q is true, then p must be true. The second conditional says that q is a necessary condition for r. This means that if ∼∼q (which is logically equivalent to q) is true, then r must be true. Since q  q is a logical truth, p  r must follow from (p  q (r  q). The following argument is an instance of such a form:

GM can be competitive only if it increases outsourcing. UAW workers can have job security only if GM does not increase outsourcing. GM either increases or does not increase outsourcing. Therefore, either GM cannot be more competitive or UAW workers cannot have job security. 3.3i

  (C I) (J I)

  I I

  C J

The Problem of Evil — a Destructive Dilemma

There is a well-known philosophical problem called the problem of evil in western philosophy and religions. It argues that God is either not all-powerful or not all-good. The argument can be constructed as a destructive dilemma:

  1. If God is all-powerful, He would be able to eliminate evil.
  2. If God is all-good, He would want to eliminate evil.
  3. Evil exists. (This means that God is not able to eliminate evil, or God does not want to eliminate evil.)
  4. Therefore, God is either not all-powerful or not all-good.

After it is symbolized as


  (P A) (G W)

  A W

  P G

it is clear that the argument indeed is an instance of destructive dilemma. This helps us see that many attempted solutions to the problem of evil (called theodicies) are efforts to refute one of its premises.

3.3.2 Two Formal Fallacies

The mix-up of the sufficient condition and the necessary condition produces two common invalid forms. They are affirming the consequent and denying the antecedent. It is important not to confuse them with Modus Ponens and Modus Tollens.

Affirming the Consequent (AC)

Affirming the consequent mistakes a necessary condition for a sufficient condition. If q is a necessary condition of p, then even if q is true, p may still be false. This is why affirming the consequent is invalid.


  p q

  q

  p

The next argument has two true premises, but its conclusion is false. It is a counterexample that illustrates the invalidity of affirming the consequent.

If Isaac Newton is a biologist, then he is a scientist. Isaac Newton is a scientist. Therefore, he is a biologist. 3.3j

  B S

  S

  B

Denying the Antecedent (DA)

Denying the antecedent concludes that q must be false on the basis that a sufficient condition p is not true. The correct conclusion to draw from p being false should be that q can be true or false.


  p q

  p

  q

Here is another counterexample that shows the form is invalid.

If Bill Gates owns Exxon Mobil, then he is a billionaire. Bill Gates does not own Exxon Mobil. Therefore, he is not a billionaire. 3.3k

  O B

  O

  B

3.3.3 Recognizing Common Forms

In learning the basic argument forms, we use “p”, “q”, “r” and “s” as variables. They serve as place holders in argument forms. If we replace each variable in a basic form with a capital letter, we would of course end up with an instance of the form. But we can also replace a variable with a compound sentence. The resulting argument would also be an instance of the form. Such substitutions give us more flexibility in constructing instances of the basic forms. For instance, if we take the form modus ponens and replace p with H and q with R B, the resulting argument


  H (R B)

  H

  R B

would be an instance of modus ponens. The substitution can also go the other direction, that is, we can also replace a compound sentence with a variable. Such substitutions can help us identify basic forms. Take a look at the next argument.

The current economic growth cannot be sustained unless inflation is under control. Inflation is not under control. Therefore, the current economic growth cannot be sustained. 3.3l

The argument can be symbolized as


  S U

  U

  S

Since S U is logically equivalent to U  S (as we will see in the next section, this is called the rule of commutativity). We can rewrite the argument as:


  U  S

  U

  S

Now by the following substitutions:

p = U

q = S

we would then have


  p q

  p

  q

This helps us see that argument (3.3l) is an instance of disjunctive syllogism. In the next example, we should recognize A K as the antecedent p and D as the consequent q. As a result, it is a modus ponens. Use the play button button below to step through the illustration.

To properly identify the next form as an instance of disjunctive syllogism, we need to apply the rule of double negation, which says that p is logically equivalent to ∼∼p. Afterwards, we substitute p for  M and q for D.

3.3.4 Combining Basic Forms

We can combine basic argument forms to construct longer and more complex arguments. The argument (3.3a)

If interest rates are raised, the stock market will be hurt. If the stock market is hurt, the economy will slow down. But if interest rates are not raised, inflation will get worse. If inflation gets worse, the economy will slow down. So the economy will slow down. 3.3a

is built by combining two hypothetical syllogisms with a constructive dilemma. It is easier to see the logical structure from the symbolization.


  R S

  S E

  R W

  W E

  (R R)

  E

Notice that we include the tautology R  R as the last premise. The tautology goes unstated in the original argument because it is trivial that it is true. Now from the first two premises, we can derive  E as a conclusion based on hypothetical syllogism.


  R S

  S E

  R E

Using hypothetical syllogism one more time, we can draw the conclusion R  E from the third and the fourth premises.


  R W

  W E

  R E

Next, using the two conditionals R  E and R ⊃ E, and the tautology ∨ ∼R, we arrive at the conclusion E  E by constructive dilemma. The conclusion E  E is logically equivalent to E.


  R E

  R E

  R R

  E

Using Basic Forms to Determine Validity

As we saw above, the argument (3.3a) is constructed by combining three basic forms. Since each of them is valid, we can determine that (3.3a) is valid without constructing a long truth table with 16 rows.

Since long arguments are often constructed out of basic forms, we can determine their validity by identifying the basic forms. If all of the basic forms are valid, then the long argument is valid. But if one of the basic forms is invalid, then the long argument is invalid. This is not a rigorous formal process like the truth table method. But it does enable us to determine validity without constructing truth tables. When we try to break up a long argument into basic forms, we need to, when possible, identify valid forms first. To decide the validity of the argument,

A new game console is in high demand only if there are a lot of exciting games available for it. However, many game developing companies won’t design new games for a new console unless it is in high demand. Since there are not a lot of exciting games available for a new console, it follows that many game developing companies won’t design new games for it. 3.3m

we first symbolize it as


  H E

  D  H

  E

  D

Again, according to the rule of commutativity, D  H is logically equivalent to H  D. So we can rewrite the argument form as


  H E

  H  D

  E

  D

Then we break it apart into the following two forms:


  H E
and
  H  D

  E
 
  H

  H
 
  D
  Modus Tollens
 
Disjunctive Syllogism

Since argument (3.3m) is formed by combining a modus tollens with a disjunctive syllogism, it is hence valid. The diagram below shows how the conclusion is derived from the premises—the logical flow of the argument.

Your browser does not support SVG

In the next example,

If we continue the acceleration of production and consumption, we will deplete natural resources within one hundred years. If natural resources are depleted within one hundred years, life on earth will not be sustainable. We continue to accelerate production and consumption. As a result, life on earth will not be sustainable. 3.3n

the argument is symbolized as


  C D

  D S

  C

  S

We can see that it is constructed from the following two valid forms, and thus is valid.


  C D
and
  C S

  D S
 
  C

  C S
 
  S
  Hypothetical Syllogism
 
Modus Ponens

The logical flow of the argument is illustrated below.

Your browser does not support SVG

The next argument

If one is a fiscal conservative, then one would be against big government spending. But if one is against big government spending, then one would support budget cut on military spending. President Bush supports budget cut on military spending. Therefore, he is a fiscal conservative. 3.3o

  F A

  A S

  S

  F

is invalid because after we separate it into two forms:


  F A
and
  F ⊃ S

  A S
 
  S

  F S
 
  F
  Hypothetical Syllogism
 
Affirming the Consequent

we find that the second form is invalid.

Exercise 3.3

  1. Decide whether each of the arguments is one of the common forms. If it is, identify the name of the form and decide its validity. If it is not a common form, label it as “No Form” and use the truth table to determine its validity.
    • Click on Check Answers at the end of the section to see if your answers are correct.
    • You can change the answers marked as incorrect and click on Check Answers again.
    • Reload the page to get rid of answers and correction marks.
1. A C
A
    2. H K
H
 
  C       K  
     
  Valid
Invalid
    Valid
Invalid
3. E G
G
    4. S M
M
 
  E       S  
     
  Valid
Invalid
    Valid
Invalid
5. R D
R
    6. F P
P
 
  D       F  
     
  Valid
Invalid
    Valid
Invalid
7. B C
B
    8. A L
L
 
  C       A  
     
  Valid
Invalid
    Valid
Invalid
9. N  G
N
    10. K M
M E
 
  G       K E  
     
  Valid
Invalid
    Valid
Invalid
11. D E
P D
    12. (S V) (A U)
V U
 
  P E       S A  
     
  Valid
Invalid
    Valid
Invalid
13. C F
F
    14. (R L) (R E)
R R
 
  C       L E  
     
  Valid
Invalid
    Valid
Invalid
15. (H  N)  S
H  N
    16. (A B) K
(A B)
 
  S       K  
     
  Valid
Invalid
    Valid
Invalid
17. (J M) (P D)
J ∨ ∼P
    18. F (D E)
(D E)
 
  M D       F  
     
  Valid
Invalid
    Valid
Invalid
19. C A
A N
    20. (R C) S
S T
 
  C N       (R C) T  
     
  Valid
Invalid
    Valid
Invalid

 

  1. Use the common argument forms to derive the conclusion from the premises. Give the name of the argument form used.
    • Click on one of the connective buttons to type the connective.
    • Click on Check Answers at the end of the section to see if your answers are correct.
    • You can change the answers marked as incorrect and click on Check Answers again.
    • Reload the page to get rid of answers and correction marks.
1. A E
E
    2. D H
D
 
     
     
     
3. C R
R
    4. K B
B R
 
     
     
     
5. G  N
G
    6. (K A)  M
M
 
     
     
     
7. S  L
S
    8. B R
D  S
B D
 
       
     
     
       
9. C  D
D
    10. (E  U)  A
(E U)
 
     
     
     
11. (P  H)  N
P  H
    12. (G  A)  (B  R)
A R
 
     
     
     
13. S  E
E  P
    14. (J D)  Q
J D
 
     
     
     
15. K  (G N)
K
    16. B F
C  (N  L)
F  (N  L)
 
       
     
     
       

 

  1. Decide whether each of the following arguments is valid by showing how it is constructed out of the common forms. Identify each common form with its abbreviated name.
    • Click on one of the connective buttons to type the connective.
    • Click on Check Answers at the end of the section to see if your answers are correct.
    • You can change the answers marked as incorrect and click on Check Answers again.
    • Reload the page to get rid of answers and correction marks.
1. H G   D H   H G
  D H   D  
  D     G
  G    
  Valid
Invalid
2. M B   M B   B  C
  B  C   M  
  M     C
  C  
  Valid
Invalid
3. A E   A E   A  S
  A  S   E  
  E     S
  S  
  Valid
Invalid
4. K R   K R   K N
  R   R  
  K N     N
  N  
  Valid
Invalid
5. D C   B D   D C
  B D   B  
  B     C
  C  
  Valid
Invalid
6. H  (G E)   H  (G E)   P H
  P H   (G E)  
  (G E)     P
  P  
  Valid
Invalid
7. A L   A L     A M
  A M   L S   S  
  L S       M
  S  
  M  
  Valid
Invalid
         
8. N  K   R  O   R  N   N  K
  R  N      
  R  O       K
  O  
  K  
  Valid
Invalid
         
9. C  E   C  B  
  C  B    
  E M     B
  M    
  B  
  Valid
Invalid
10. W  (G H)   W  (G H)  
  W    
  H     G
  G  
  Valid
Invalid
11. (A D) B   D (B H)    
  D (B H)      
  H       (A D)
  D  
  (A D)  
  Valid
Invalid
         
12. (R  L)  P      
  P  L   P   P  
  P       R
  R  
  Valid
Invalid
13. S  G   S G  
  N  D    
  G  D     K
  (S  N)  K    
  K  
  Valid
Invalid
14. (G M) A      
  A  (E  O)      
  G M       B  O
  B  E  
  B  O  
  Valid
Invalid

 

This work is licensed under CC BY-NC-ND 4.0