### General Form of an Argument.

A |

B |

\(\therefore\ \)C |

We've been looking at logical statements, and now we want to be able to put statements together to form logical arguments. Just like with the statements, we are going to be concerned more about the structure of an argument than the specific content.

An argument consists of premises and a conclusion. You must have at least one premise, but can have as many as you like. You have exactly one conclusion.

A |

B |

\(\therefore\ \)C |

Since an argument is just a list of statements, we need some structure for what makes a “good” argument.

An argument is valid if whenever the premises are true, the conclusion must be true.

An argument is invalid if it is possible for the premises to be true and the conclusion false.

It is really important to note that validity of an argument does not depend on the actual truth or falsity of the statements. To decide if an argument is valid, we construct a truth-table for the premises and conclusion. Then we check for whether there is a case where the premises are true and the conclusion false.

Decide whether the following argument is valid or invalid.

We construct a truth-table with a columnn for each premise and conclusion. Table 2.3.4.

\(p\wedge q\) |

\(\therefore\ \)\(p\) |

\(p\) | \(q\) | \(p\wedge q\) | \(p\) |

T | T | T |
T |

T | F | F | T |

F | T | F | F |

F | F | F | F |

Since we are looking for where the premise is true, we only need to look at the first row (in bold). In this case, the conclusion is also true. Thus, whenever to premises are true the conclusion must be true. Hence, the argument is valid.

Decide whether the following argument is valid or invalid.

We construct a truth-table with a columnn for each premise and conclusion. Table 2.3.6.

\(p\vee q\) |

\(\therefore\ \)\(p\) |

\(p\) | \(q\) | \(p\vee q\) | \(p\) |

T | T | T |
T |

T | F | T |
T |

F | T | T |
F |

F | F | F | F |

The first three rows all have true premises. However, in the case that \(p\) is false and \(q\) is true, the premise is true while the conclusion is false. Thus, it is possible to have true premises and a false conclusion. Hence, the argument is invalid.

Use a truth-table to determine if the following argument is valid or invalid.

\(p\rightarrow q\) |

\(\sim q\) |

\(\therefore\ \)\(\sim p\) |

Use a truth-table to determine if the following argument is valid or invalid.

\(p\rightarrow q\) |

\(\sim p\) |

\(\therefore\ \)\(\sim q\) |

Use a truth-table to determine if the following argument is valid or invalid.

\(p\ \vee q\) |

\(p\rightarrow r\) |

\(q\rightarrow r\) |

\(\therefore\ \)\(r\) |

Let's look at a more specific example:

The sun is purple and the sun sets in the west. |

Therefore, the sun is purple. |

Although the two statements are false, the argument is still valid. It has the form of Example 2.3.3, which we determined was valid. But if we think about the definition of validity, we should be able to see that it would be impossible to have the premise be true while the conclusion is false.

If possible, give an example of an argument (in sentences, not variables) that meets the given criteria. If it is not possible, just state that it is not possible.

A valid argument that has false premises and a true conclusion.

An invalid argument that has false premises and a true conclusion.

A valid argument that has true premises and a true conclusion.

An invalid argument that has true premises and a true conclusion.

A valid argument that has true premises and a false conclusion.

An invalid argument that has true premises and a false conclusion.

Modus ponens:

\(p\rightarrow q\) |

\(p\) |

\(\therefore\ \)\(q\) |

Modus tollens:

\(p\rightarrow q\) |

\(\sim q\) |

\(\therefore\ \)\(\sim p\) |

Transitivity:

\(p\rightarrow q\) |

\(q\rightarrow r\) |

\(\therefore\ \)\(p\rightarrow r\) |

We will show that transitivity is a valid argument using a truth-table. Table 2.3.9. Truth-table for transitivity.

\(p\) | \(q\) | \(r\) | \(p\rightarrow q\) | \(q\rightarrow r\) | \(p\rightarrow r\) |

T | T | T | T |
T |
T |

T | T | F | T | F | F |

T | F | T | F | T | T |

T | F | F | F | T | F |

F | T | T | T |
T |
T |

F | T | F | T | F | T |

F | F | T | T |
T |
T |

F | F | F | T |
T |
T |

Looking at the rows where both premises are true (in bold), we can see that the conclusion must be true. Thus, the argument is valid.

Converse error:

\(p\rightarrow q\) |

\(q\) |

\(\therefore\ \)\(p\) |

Inverse error:

\(\sim p\rightarrow q\) |

\(p\) |

\(\therefore\ \)\(\sim q\) |

Since it is possible to have a valid argument with a false conclusion, but we'd like our arguments to have true conclusions, we need something more to have a “good” argument.

An argument is sound if it is valid and all the premises are true.

Since a valid argument cannot have true premises and a false conclusion, if the premises are actually true, then the argument must have a true conclusion. Note, soundness of an argument *does* depend on the actual content of the statements.

Which or your arguments in Activity 2.3.4 are sound?

- Row 1
- To be invalid, you do want to look for true premises, but what should the conclusion be?
- Row 2
- To be invalid, you want to look for true premises.
- Row 3
- In the third row we have true premises and a false conclusion, thus the argument is invalid.
- Row 4
- To be invalid, you want to look for true premises.

The following is the truth-table for an argument with converse error.

\(p\) | \(q\) | \(p\rightarrow q\) | \(q\) | \(p\) |

T | T | T | T | T |

T | F | F | F | T |

F | T | T | T | F |

F | F | T | F | F |

Which row of the truth-table shows us the argument is invalid?

- The argument is valid.
- The third row of the truth-table is the only one with all true premises. In this case the conclusion is true. Thus it is valid.
- The argument is invalid.
- In the truth-table is it possible to have all the premises be true while the conclusion is false?
- I am unable to determine if the argument is valid or invalid.
- In the truth-table look for all rows in which all the premises are true. Is is possible to have a false conclusion (invalid), or must the conclusion be true (valid)?

Use a truth-table to determine if the following argument is valid or invalid.

\(p\vee q\) |

\(\sim p\) |

\(\therefore\ \)\(q\) |

True.

False.

True or False: A valid argument can have false premises and a true conclusion.

True.

False.

True or False: An invalid argument can have true premises and a true conclusion.

True.

False.

True or False: A valid argument can have true premises and a false conclusion.

True.

False.

True or False: A sound argument can have false premises and a true conclusion.

True.

False.

True or False: A sound argument can have true premises and a false conclusion.

Use a truth-table to determine if the following argument is valid or invalid. Indicate the premises and conclusion on your table. Clearly state your conclusion and explain how your truth-table supports your conclusion.

\(p\) |

\(p\rightarrow q\) |

\(\sim q\ \vee r\) |

\(\therefore r\) |

Use a truth-table to determine if the following argument is valid or invalid. Indicate the premises and conclusion on your table. Clearly state your conclusion and explain how your truth-table supports your conclusion.

\((p\ \wedge q)\rightarrow \sim r\) |

\(p\ \vee \sim q\) |

\(\sim q\rightarrow p\) |

\(\therefore \sim r\) |

Use a truth-table to show that the following argument is valid. Indicate the premises and conclusion on your table. Explain how your truth-table supports your conclusion.

\(p \ \vee q\) |

\(\sim p\) |

\(\therefore q\) |

Use a truth-table to show that the following argument (modus tollens) is valid. Indicate the premises and conclusion on your table. Explain how your truth-table supports your conclusion.

\(p\rightarrow q\) |

\(\sim q\) |

\(\therefore \sim p\) |

Use a truth-table to show that the following argument (also known as proof by cases) is valid. Indicate the premises and conclusion on your table. Explain how your truth-table supports your conclusion.

\(p\ \vee q\) |

\(p\rightarrow r\) |

\(q\rightarrow r\) |

\(\therefore r\) |

Determine whether the following arguments are valid or invalid. If they are invalid, determine if they exhibit the converse error or the inverse error. Rewrite each argument using symbols to help determine validity.

If Jules solved this problem correctly, then Jules obtained the answer \(\pi\text{.}\) Jules obtained the answer \(\pi\text{.}\) \(\therefore\) Jules solved the problem correctly. If at least one of these two numbers is divisible by 6, then the product of these two numbers is divisible by 6. Neither of these two numbers is divisible by 6. \(\therefore\) The product of these two numbers is not divisible by 6.

Explain in your own words what distinguishes a valid form of argument from an invalid one.