Lesson 3.4: Quantifiers and Formal Logic

Introduction

In this lesson, students will learn about quantifiers and formal logic which are essential tools in logical reasoning. Understanding how to properly use and interpret quantifiers helps in tackling various logical reasoning questions on the LSAT. The key concepts we will cover include reasoning with quantifiers such as "all," "some," "most," and "none," how to combine quantified statements, valid and invalid inferences, and common quantifier fallacies.

Learning Objectives

By the end of this lesson, students will be able to:

Reason with the quantifiers "all," "some," "most," and "none," and combine quantified statements effectively.
Identify and differentiate between valid and invalid quantifier inferences.
Combine multiple quantified statements to derive valid conclusions.
Recognize common fallacies related to quantifiers.
Explain the main concepts and terminology associated with quantifiers in formal logic.

Section 1: Understanding Quantifiers

Types of Quantifiers

Quantifiers are words or phrases that indicate the quantity of subjects to which a statement applies. The main quantifiers we will cover are:

Universal Quantifier: This refers to statements that are true for all members of a specified group. It is represented by the term "all" and can be symbolically denoted as:

$$\forall x (P(x))$$

This means "for all x, P is true."

Existential Quantifier: This refers to statements that are true for at least one member of a specified group. It is represented by the term "some" and can be symbolically denoted as:

$$\exists x (P(x))$$

This translates to "there exists an x such that P is true."

Most: This indicates a majority but not all. It is important to remember that saying "most" does not imply "all."
None: This indicates that no members of a specified group satisfy the condition. It can be denoted as:

eg $\exists$ x (P(x))$$

This means "there does not exist an x such that P is true."

Example 1: Universal and Existential Quantifiers

Consider the following statements:

All cats are mammals.

This can be expressed as: $$\forall x (Cat(x) \Rightarrow Mammal(x))$$

Some mammals are dogs.

This can be expressed as: $$\exists x (Mammal(x) \land Dog(x))$$

In these examples, the first statement claims something about every member of the category of cats, while the second statement makes a claim about at least one member of the category of mammals.

Section 2: Combining Quantified Statements

To effectively reason with quantifiers, one must know how to correctly combine them. For instance, we can use multiple quantifiers in a single argument or premise. This section will discuss how to do that correctly.

Example 2: Combining Statements

Let’s consider these two statements:

All dogs are animals.

$$\forall x (Dog(x) \Rightarrow Animal(x))$$

Some animals are friendly.

$$\exists x (Animal(x) \land Friendly(x))$$

From these two statements, we can infer that:

Some dogs are friendly.
This conclusion only follows if we explicitly state or know that the friendly animals include dogs.

However, if we don’t have that connecting statement, the conclusion does not logically follow. It's crucial to be aware of what each statement implies before drawing a conclusion.

Section 3: Valid and Invalid Inferences

In logical reasoning, an inference is a conclusion drawn from premises. Therefore, understanding which inferences are valid is key to mastering logic.

Valid Inference Example

Consider the statements:

All birds can fly.

$$\forall x (Bird(x) \Rightarrow CanFly(x))$$

Tweety is a bird.

$$Bird(Tweety)$$

From these premises, we can validly infer that:

Tweety can fly.
$$CanFly(Tweety)$$

Invalid Inference Example

Now consider:

Some dogs are not friendly.

$$\exists x (Dog(x) \land

eg Friendly(x))$$

All pets are friendly.

$$\forall x (Pet(x) \Rightarrow Friendly(x))$$

From these premises, an invalid inference would be:

Some dogs are pets.
This is not a valid inference as the premises do not support this conclusion.

Section 4: Common Quantifier Fallacies

Fallacies are mistaken beliefs or errors in reasoning. Recognizing them is vital for effective logical reasoning. Here are some common fallacies involving quantifiers:

Fallacy of the Converse

When one incorrectly assumes the conclusion from a statement of the form:

If P, then Q (i.e., $ P \Rightarrow Q ) $

Then one concludes:

If Q, then P (i.e., $ Q \Rightarrow P ) $

Example of the Fallacy of the Converse

From the statement, "If it rains, then the ground is wet," (i.e., $ Rains \Rightarrow Wet $) one might incorrectly conclude that:

If the ground is wet, then it rained (i.e., $ Wet \Rightarrow Rains $).

This is a fallacy because the ground could be wet for other reasons, such as someone watering the garden.

Fallacy of the Exclusive OR

This mistake occurs when it is assumed that if one alternate is true, the other must be false.

For example, someone might say, "A person is either a student or a working professional," and conclude wrongly that if someone is a cat, they must be neither.

Conclusion

In this lesson, students has learned critical concepts in quantifiers and formal logic. Understanding how to use and interpret quantifiers allows for better reasoning skills, especially in answering LSAT questions. By mastering the distinctions between universal and existential quantifiers, and the implications of combining statements, students can avoid common logical fallacies, and ultimately improve their logical reasoning capabilities.

Study Notes

Quantifiers convey the quantity of subjects in a logical statement: "all," "some," "most," and "none."
Universal Quantifier: $\forall x (P(x))$ means true for all instances.
Existential Quantifier: $\exists x (P(x))$ means true for at least one instance.
Take care when combining quantified statements to ensure valid conclusions.
Common fallacies include the Converse Fallacy and Exclusive OR Fallacy.
An inference must logically follow from given premises to be considered valid.