Valid and Invalid Arguments
Valid and Invalid Arguments
Arguments
Arguments
2
Arguments
Consider the following argument.
3
Arguments
5
Example 1 – Write an Argument in Symbolic Form
Write the following arguments in symbolic form.
a. If logic is easy, then I am a monkey’s uncle. I am not a monkey’s
uncle. Therefore, logic is not easy.
Answer:
b. If this number is larger than 2, then its square is larger than 4. This
number is not larger than 2. Therefore, the square of this number is
not larger than 4.
Answer:
6
Check Your Progress 1
7
Arguments and Truth Tables
8
Arguments and Truth Tables
The following truth table procedure can be used to determine
whether an argument is valid or invalid.
9
Example 2 – Determine the Validity of an Argument
Determine whether the following argument is valid or invalid.
10
Example 3 – Determine the Validity of an Argument
Determine whether the following argument is valid or invalid.
If this number is larger than 2, then its square is larger than 4. This
number is not larger than 2. Therefore, the square of this number is not
larger than 4.
11
Check Your Progress 2
12
Example 3 – Determine the Validity of an Argument
𝑝→𝑟
𝑟______
∴𝑝
13
Check Your Progress 3
14
Seatwork – Determine the Validity of an Argument
15
Standard Forms
16
Standard Forms/ Rules of Inference
1. Modus Ponens or Direct Reasoning
The most famous form of syllogism in logic that is known to be
valid is called modus ponens. It has the following form:
𝒑→𝒒
𝒑_____
∴𝒒
17
Standard Forms: Modus ponens and Modus tollens
Examples. Use Modus ponens and Modus tollens to
determine whether the argument is valid or not.
Standard Forms: Modus ponens and Modus tollens
Examples. Use modus ponens or modus tollens to fill in
the blanks of the following arguments so that they
become valid inferences.
3. Generalization
These argument forms are used for making generalizations.
a. 𝑝 __ b. 𝑞 __
∴𝑝∨𝑞 ∴𝑝∨𝑞
4. Specialization
These argument forms are used for specializing.
a. 𝑝 ∧ 𝑞 b. 𝑝 ∧ 𝑞
∴𝑝 ∴𝑞
Standard Forms/ Rules of Inference
5. Elimination
These argument forms say that when you have only two possibilities
and you can rule one out, the other must be the case.
a. 𝑝 ∨ 𝑞 b. 𝑝 ∨ 𝑞
~𝑞___ ~𝑝___
∴𝑝 ∴𝑞
6. Transitivity
If an argument is a chain of if-then statements, we can conclude that
the first statement implies the last.
𝑝→𝑞
𝑞 → 𝑟__
∴𝑝→𝑟
Standard Forms/ Rules of Inference
Example 4. Use the argument forms to determine whether the
following arguments are valid or invalid.
b. 𝒎 → ~𝒏
𝒎_______
∴ ~𝒏
c. 𝒉 ∨ 𝒋
~𝒉___
∴𝒋
23
Standard Forms/ Rules of Inference
d. If the price of gold rises 𝒈 , the stock market will fall (𝒔). If
the stock market will fall (𝒔), I’m not investing in the stock
market (~𝒊). Therefore, if the price of gold rises, I’m not
investing in the stock market.
24
Standard Forms of Two Invalid Arguments
Any argument that has one of these symbolic forms is invalid.
1. Fallacy of the converse
𝒑→𝒒
𝒒_____
∴𝒑
25
Standard Forms/ Rules of Inference
a. If you can read this book (𝒓), you can go to college (𝒄). You
cannot read the book. Therefore, you cannot go to college.
b. If it’s difficult to obtain (𝒅), it can last long (𝒍). It can last
long. Therefore, it’s difficult to obtain.
26
Standard Forms/ Rules of Inference
More Examples.
Determine whether the argument is valid or invalid.
27
Valid Argument Forms
3. If I go to the movies, I won’t finish my homework. If I don’t finish my
homework, I won’t do well on the exam tomorrow. Therefore, If I go to
the movies, I won’t do well on the exam tomorrow.
28
29
30
31
Valid Argument Forms
More Examples.
Hidden Treasure
In the back of an old cupboard, you discover a note signed by a pirate
famous for his bizarre sense of humor and love of logical puzzles. In the
note he wrote that he had hidden treasure somewhere on the property.
He listed five true statements (a–e below) and challenged the reader to
use them to figure out the location of the treasure.
a. If this house is next to a lake, then the treasure is not in the kitchen.
b. If the tree in the front yard is an elm, then the treasure is in the
kitchen.
c. This house is next to a lake.
d. The tree in the front yard is an elm or the treasure is buried under the
flagpole.
e. If the tree in the back yard is an oak, then the treasure is in the
garage.
Where is the treasure hidden? 32
Arguments with quantifiers
Quantifiers
Consider the following argument:
34
Two Types of Quantifiers
There are two types of quantifiers, the existential quantifiers and
the universal quantifiers.
The phrases for some, there exists, and at least one are called
existential quantifiers. The words none, all, and every, are called
universal quantifiers.
35
Negation of Quantified Statements
Consider the false statement,
“No mathematicians are good-looking”.
36
Negation of Quantified Statements
The table below shows how to write the negation of statements in
quantified form.
38
Arguments Involving Quantifiers
We use the diagram below to determine validity or invalidity of
arguments involving quantifiers.
39
Arguments Involving Quantifiers
Example 7. Determine whether the argument is valid or invalid
using the Euler diagram.
41
More Exercises
42