Critical Thinking
Critical Thinking
Randy Ridenour
2020-08-03
2
Contents
3
4 CONTENTS
Preface
1
As a wise man once said, every person has to decide for themselves what level of
hypocrisy they’re willing to live with.
5
6 CONTENTS
Chapter 1
Introduction
1.1 Welcome
We human beings find it very difficult to completely clear our minds. That
means you have been thinking of something nearly every waking moment
since you began to think. If we assume eight hours of sleep every night, then
that comes to just over 7,000,000 minutes of thinking in 20 years. Surely,
after that much time spent doing something, you ought to have become pretty
good at it. So, why should you consider reading a book or taking a course
that claims to teach you how to do something you’ve been doing for years?
Well, as the old saying goes, I have some good news and some bad news. The
bad news is that we’re just not very good at thinking carefully. Some things
are easy enough for us – you probably don’t have a problem when it comes
to deciding whether you should step out in front of a truck. On the other
hand, when it comes to difficult, tricky subjects, we’re often more likely to
come up with wrong answers as right ones.
A ball and bat together cost $1.10, and the bat costs $1.00 more
than the ball does. How much does the ball cost?
I’ll give you some time to think about your answer, although you shouldn’t
need much time. So, whenever you’re ready. . . .
7
8 CHAPTER 1. INTRODUCTION
Was your answer ten cents? That’s the most common answer, but it’s also
clearly wrong. If the ball costs ten cents, and the bat costs a dollar more
than the ball, then the bat costs $1.10 and the total would be $1.20. The
right answer has to be five cents: $1.05 + $.05 = $1.10. Even though it’s not
a difficult problem, most people get it wrong.
On the other hand, maybe we get it wrong because it’s not a difficult problem.
It looks so simple that we answer it without thinking about it. When we don’t
reason carefully about a problem, our minds provide us with an automatic
answer. In some situations, the automatic answer provided by the mind is
very likely to be true. In others, it is very likely to be false.
At this point, you might be asking yourself, “So what?” What’s the worst
that could happen, maybe getting a nickel extra in change when you buy the
ball? This still doesn’t justify taking a whole course to learn how to think
better, does it?
Consider one more example:
1% of women at age forty who participate in routine screening
have breast cancer. 80% of women with breast cancer will get
positive mammographies. 9.6% of women without breast cancer
will also get positive mammographies. A woman in this age group
had a positive mammography in a routine screening. What is the
probability that she actually has breast cancer?
Unlike the ball and the bat, being wrong in this case could have drastic
consequences—if the doctor guessed too low, then the patient likely did not
receive the treatment she needed. If the doctor guessed too high, then the
patient may received radical treatments that she didn’t need, unnecessary
radiation, chemotherapy, or even a radical mastectomy.
Doctors have to make these diagnoses all the time, so surely they would be
good at correctly estimating the patient’s likelihood of having the disease.
Most doctors estimated that, in this problem, the patient’s chances of having
breast cancer are somewhere between 70 and 80%. Only 15% of doctors
surveyed were correct, however. Surprisingly, the right answer is 7.8%, a mere
one-tenth of the estimates by the medical professionals.1
1
That doesn’t mean that the test should be ignored. It just means that the doctors
should not immediately begin dangerous treatments. What is warranted is further testing
1.2. WHAT IS CRITICAL THINKING? 9
So, how does one avoid making such mistakes? The best way is to become
a better critical thinker. You’ve taken the right initial steps by reading this
book and taking this class.
• Attentiveness
• Fairness
• Perseverance
• Firmness
So, by the end of this book, and by the end of your course, I hope that you
are well on the road to acquiring these skills. Like any other skills, they
cannot be acquired without practice. You will not become a perfect critical
thinker in a semester, maybe not even over the course of a lifetime. You can,
however, take some significant steps on a journey that leads to one of the
most important destinations ever: the truth.
12 CHAPTER 1. INTRODUCTION
Part I
Logic
13
Chapter 2
Arguments
The fundamental tool of the critical thinker is the argument. For a good
example of what we are not talking about, consider a bit from a famous sketch
by Monty Python’s Flying Circus:1
Man: (Knock)
Mr. Vibrating: Come in.
Man: Ah, Is this the right room for an argument?
Mr. Vibrating: I told you once.
Man: No you haven’t.
Mr. Vibrating: Yes I have.
Man: When?
Mr. Vibrating: Just now.
Man: No you didn’t.
Mr. Vibrating: Yes I did.
Man: You didn’t!
Mr. Vibrating: I did!
Man: You didn’t!
Mr. Vibrating: I’m telling you I did!
Man: You did not!!
Mr. Vibrating: Oh, I’m sorry, just one moment. Is this a five minute argument
or the full half hour?
1
(?).
15
16 CHAPTER 2. ARGUMENTS
Now that we have the argument in standard form, we can talk about premise
1, premise 2, and all clearly be referring to the same thing.
table : indwords
Conclusion Premise
Therefore Since
So Because
Thus For
Hence Is implied by
Consequently For the reason that
Implies that
It follows that
Each argument will likely use only one indicator word or phrase. When
the conlusion is at the end, it will generally be preceded by a conclusion
indicator. Everything else, then, is a premise. When the conclusion comes
at the beginning, the next sentence will usually be introduced by a premise
indicator. All of the following sentences will also be premises.
For example, here’s our previous argument rewritten to use a premise indicator:
Susan should do well in Calculus II, because Calculus II will be
18 CHAPTER 2. ARGUMENTS
2.1.2.1 Non-Arguments
One thing that complicates our task of identifying arguments is that there are
many passages that, although they look like arguments, are not arguments.
The most common types are:
1. Explanations
2. Mere asssertions
3. Conditional statements
4. Loosely connected statements
Explanations can be tricky, because they often use one of our indicator words.
Consider this passage:
Abraham Lincoln died because he was shot.
If this were an argument, then the conclusion would be that Abraham Lincoln
died, since the other statement is introduced by a premise indicator. If this is
an argument, though, it’s a strange one. Do you really think that someone
would be trying to prove that Abraham Lincoln died? Surely everyone knows
that he is dead. On the other hand, there might be people who don’t know
how he died. This passage does not attempt to prove that something is true,
but instead attempts to explain why it is true. To determine if a passage
is an explanation or an argument, first find the statement that looks like
the conclusion. Next, ask yourself if everyone likely already believes that
statement to be true. If the answer to that question is yes, then the passage
is an explanation.
Mere assertions are obviously not arguments. If a professor tells you simply
2.1. IDENTIFYING ARGUMENTS 19
that you will not get an A in her course this semester, she has not given you
an argument. This is because she hasn’t given you any reasons to believe that
the statement is true. If there are no premises, then there is no argument.
Conditional statements are sentences that have the form “If. . . , then. . . .” A
conditional statement asserts that if something is true, then something else
would be true also. For example, imagine you are told, “If you have the
winning lottery ticket, then you will win ten million dollars.” What is being
claimed to be true, that you have the winning lottery ticket, or that you
will win ten million dollars? Neither. The only thing claimed is the entire
conditional. Conditionals can be premises, and they can be conclusions. They
can be parts of arguments, but that cannot, on their own, be arguments
themselves.
Finally, consider this passage:
I woke up this morning, then took a shower and got dressed. After
breakfast, I worked on chapter 2 of the critical thinking text. I
then took a break and drank some more coffee. . . .
This might be a description of my day, but it’s not an argument. There’s
nothing in the passage that plays the role of a premise or a conclusion. The
passage doesn’t attempt to prove anything. Remember that arguments need
a conclusion, there must be something that is the statement to be proved.
Lacking that, it simply isn’t an argument, no matter how much it looks like
one.
premises are true, then the conclusion must also be true. Another way to
state this is
Note that claiming that an argument is valid is not the same as claiming
that it has a true conclusion, nor is it to claim that the argument has true
premises. Claiming that an argument is valid is claiming nothing more that
the premises, if they were true, would be enough to make the conclusion true.
For example, is the following argument valid or not?
1. If pigs fly, then an increase in the minimum wage will be approved next
term.
2. Pigs fly.
3. An increase in the minimum wage will be approved next term.
The argument is indeed valid. If the two premises were true, then the
conclusion would have to be true also. What about this argument?
In this case, both of the premises are true and the conclusion is true. The
question to ask, though, is whether the premises absolutely guarantee that
the conclusion is true. The answer here is no. The two premises could be
true and the conclusion false if Spot were a cat, whale, etc.
Neither of these arguments are good. The second fails because it is invalid.
The two premises don’t prove that the conclusion is true. The first argument
is valid, however. So, the premises would prove that the conclusion is true, if
those premises were themselves true. Unfortunately, (or fortunately, I guess,
considering what would be dropping from the sky) pigs don’t fly.
These examples give us two important ways that deductive arguments can
fail. The can fail because they are invalid, or because they have at least one
false premise. Of course, these are not mutually exclusive, an argument can
be both invalid and have a false premise.
2.1. IDENTIFYING ARGUMENTS 21
If the argument is valid, and has all true premises, then it is a sound argument.
Sound arguments always have true conclusions.
Sound A deductively valid argument with all true premises.
Inductive arguments are never valid, since the premises only establish the
probable truth of the conclusion. So, we evaluate inductive arguments accord-
ing to their strength. A strong inductive argument is one in which the truth
of the premises really do make the conclusion probably true. An argument is
weak if the truth of the premises fail to establish the probable truth of the
conclusion.
There is a significant difference between valid/invalid and strong/weak. If
an argument is not valid, then it is invalid. The two categories are mutually
exclusive and exhaustive. There can be no such thing as an argument being
more valid than another valid argument. Validity is all or nothing. Inductive
strength, however, is on a continuum. A strong inductive argument can be
made stronger with the addition of another premise. More evidence can raise
the probability of the conclusion. A valid argument cannot be made more
valid with an additional premise. Why not? If the argument is valid, then
the premises were enough to absolutely guarantee the truth of the conclusion.
Adding another premise won’t give any more guarantee of truth than was
already there. If it could, then the guarantee wasn’t absolute before, and the
original argument wasn’t valid in the first place.
2.1.4 Counterexamples
One way to prove an argument to be invalid is to use a counterexample. A
counterexample is a consistent story in which the premises are true and the
conclusion false. Consider the argument above:
1. All dogs are mammals
2. Spot is a mammal.
3. Spot is a dog.
By pointing out that Spot could have been a cat, I have told a story in which
the premises are true, but the conclusion is false.
Here’s another one:
1. If it is raining, then the sidewalks are wet.
22 CHAPTER 2. ARGUMENTS
2.2 Review
1. An argument is a set of statements; one is the conclusion, the rest are
premises.
2. The conclusion is the statement that the argument is trying to prove.
3. The premises are the reasons offered for believing the conclusion to
be true.
4. Explanations, conditional sentences, and mere assertions are not argu-
ments.
5. Deductive reasoning attempts to absolutely guarantee the truth of the
conclusion.
6. Inductive reasoning attempts to show that the conclusion is probably
true.
7. In a valid argument, it is impossible for the premises to be true and
the conclusion false.
8. In an invalid argument, it is possible for the premises to be true and
the conclusion false.
9. A sound argument is valid and has all true premises.
10. An inductively strong argument is one in which the truth of the
premises makes the the truth of the conclusion probable.
11. An inductively weak argument is one in which the truth of the premises
do not make the conclusion probably true.
12. A counterexample is a consistent story in which the premises of an
argument are true and the conclusion is false. Counterexamples can be
used to prove that arguments are deductively invalid.
2.3. EXERCISES 23
2.3 Exercises
24 CHAPTER 2. ARGUMENTS
Chapter 3
Categorical Logic
Now we turn to some structured logic systems. The first, categorical logic,
is one of the oldest. It dates back at least to Aristotle (384–322 BCE).
Categorical logic is a fairly simple logic of categories or classes. A class is a
group of things that we designate with a common noun: students, teachers,
dogs, politicians, etc. Each sentence will use two different classes. One is the
subject class, and the other is the predicate class. In this logic, we can say
something about all members of a class, called a universal sentence, or we can
say something about some members of a class, called a particular sentence.
We can also make a positive claim, called an affirmation, or we can make a
negative claim, called a negation.
With these two distinctions, universal/particular and affirnation/negation,
we can make four kinds of sentences. S and P stand for the subject class and
the predicate class, respectively.
A: All S are P (universal affirmation)
E: No S are P (universal negation)
I: Some S are P (particular affirmation)
O: Some S are not P (particular negation)1
Here are some examples of categorical statements, some true and some false.
1. All dogs are mammals.
1
The letters A, E, I, and O, are thought to come from the first two vowels of the Latin
words affirmo and nego, meaning “I affirm” and “I deny.”
25
26 CHAPTER 3. CATEGORICAL LOGIC
The next step is to note the relationship between the diagonals. The diagonals
are contradictories, meaning they always have opposite truth values. They
can’t both be true, and they also can’t both be false. If the A sentence is
3.2. DIAGRAMMING SENTENCES 27
true, the O sentence must be false—if it is true that all dogs are mammals, it
cannot be true that some dogs are not mammals. If the O sentence is true,
then the A sentence must be false. It is the same for the E and the I.
Next, note the relationship between the A sentences and the E sentences,
called contraries. Like the contradictories, they cannot both be true. Unlike
the contradictories, they can both be false. If it’s true that all critical thinking
students are good students, then it must be false that no critical thinking
students are good students. If it’s false that all critical thinking students are
good students, then it can be false that critical thinking students are good
students. In fact, they are both false, because some critical thinking students
are good and others are not.
At the bottom, we have sub-contraries. They can both be false, but cannot
both be true.
Finally, we have the relationship between the top level sentences and the
bottom level sentences on the same side. This is called alternation. The
universal is called the superaltern and the particular is called the subaltern. If
the superaltern is true, then the subaltern must also be true. If the superaltern
is false, then the subaltern can be either true or false. If the subaltern is
false, then the superaltern must be false. If the subaltern is true, then the
superaltern can be either true or false. It is easy to remember this way: truth
goes down, falsity goes up.
The first step is to draw two interlocking circles. Label the left circle with an
“S” and the right circle with “P”—standing for the subject term and predicate
term, respectively.
28 CHAPTER 3. CATEGORICAL LOGIC
3.2.1 A-Sentences
Remember that the A-sentence has the form All S are P. That means that
everything that is in the S circle must also be in the P circle. To diagram
this, we shade the region of the S circle that is not contained in the P circle.
If a region is shaded, that means that nothing is in that region.
3.2.2 E-Sentences
To shade the universal negation, we shade the region that is shared by both
S and P:
3.2.3 I-Sentences
To diagram a particular affirmation, we place an x in the region shared by S
and P:
3.2.4 O-Sentences
Finally, to diagram an O-sentence, we place an x in S, but not in P:
3.2. DIAGRAMMING SENTENCES 29
3.3.1 Conversion
Conversion is the simplest of the three. The converse of a sentence simply
exchanges the subject and predicate terms of the original sentence. Conversion
applied to A-sentences is not truth-preserving. “All dogs are mammals” is
true, but “All mammals are dogs” is not. Conversion is truth-preserving for
E-sentences and I-sentences. If it is true that no dogs are reptiles, it must
be true that no reptiles are dots. Likewise, if it is true that some dogs are
brown things, it must be true that some brown things are dogs.
3.3.2 Obversion
Take another look at the square of opposition in figure 4.1. Note that the A
and the E are straight across from each other, as are the I and the O. The
first step in forming the obverse is to first change the sentence into the type
that is straight across the square of opposition. That is, if you started with
an A-sentence, then make it into and E. The O becomes and I, and so on.
Once you’ve changed the sentence type, the next step is to change predicate
into its complement. The complement of a class C is the class of everything
that is not in C. The easiest way to form a complement is to prefix the class
with ‘non’. For example, the complement of the class of students is the class
of non-students.
So, the obverse of all dogs are mammals is no dogs are non-mammals. The
obverse of no OBU students are martians is all OBU students are non-martians.
Obversion is truth-preserving in all cases.
32 CHAPTER 3. CATEGORICAL LOGIC
3.3.3 Contraposition
The last of our three relations is contraposition. To form the contrapositive
of a sentence, first form the converse, then exchange both terms for their
complements.
The contrapositive of all dogs are mammals is all non-mammals are non-dogs.
Contraposition is truth-preserving for A-sentences and O-sentences only.
Here’s a table to help keep this straight (operations that are truth-preserving
are in bold type):
Both premises and the conclusion are A-sentences. Notice that we have three
terms in the argument: dogs, mammals, and animals. Every categorical
syllogism, in proper form, has three terms. Each term occurs in two sentences.
Two of those terms will be found in the conclusion, and one term is only in
the premises. The predicate term of the conclusion is called the major term.
The subject of the conclusion is called the minor term. The term that is not
in the conclusion is called the middle term.
There are two ways to determine if a categorical syllogism is valid. One way
uses Venn diagrams, and the other involves applying some simple rules.
3.4. EVALUATING CATEGORICAL SYLLOGISMS 33
If there is any circle that has only one region left unshaded, you can place an
‘X’ in that region. This is because categorical logic assumes that there are no
empty categories, meaning that every category has at least one thing in it.
This is really only important for arguments that have an I or an O-sentence
for a conclusion. In this case, we won’t worry about it. Now that the premises
are diagrammed, check to see if the conclusion has also been diagrammed.
If so, then the argument is valid. This shows that making the premises true
was enough to make the conclusion true also.
36 CHAPTER 3. CATEGORICAL LOGIC
Propositional Logic
Categorical logic is a great way to analyze arguments, but only certain kinds
of arguments. It is limited to arguments that have only two premises and
the four kinds of categorical sentences. This means that certain common
arguments that are obviously valid will not even be well-formed arguments in
categorical logic. Here is an example:
1. I will either go out for dinner tonight or go out for breakfast tomorrow.
2. I won’t go out for dinner tonight.
3. I will go out for breakfast tomorrow.
None of these sentences fit any of the four categorical schemes. So, we need a
new logic, called propositional logic. The good news is that it is fairly simple.
39
40 CHAPTER 4. PROPOSITIONAL LOGIC
4.1.1 Negations
Negations are “not” sentences. They assert that something is not the case. For
example, the negation of the simple sentence “Oklahoma Baptist University is
in Shawnee, Oklahoma” is “Oklahoma Baptist University is not in Shawnee,
Oklahoma.” In general, a simple way to form a negation is to just place the
phrase “It is not the case that” before the sentence to be negated.
A negation is symbolized by placing this symbol ‘¬’ before the sentence-letter.
The symbol looks like a dash with a little tail on its right side. If D = ‘It is
33 degrees outside,’ then ¬D = ‘It is not 33 degrees outside.’ The negation
symbol is used to translate these English phrases:
• not
• it is not the case that
• it is not true that
• it is false that
A negation is true whenever the negated sentence is false. If it is true that it
is not 33 degrees outside, then it must be false that it is 33 degrees outside.
if it is false that Tulsa is the capital of Oklahoma, then it is true that Tulsa
is not the capital of Oklahoma.
When translating, try to keep the simple sentences positive in meaning. Note
4.2. CONJUNCTION 41
the warning on page 24, about the example of affirming and denying. Denying
is not simply the negation of affirming.
4.2 Conjunction
Negations are “and” sentences. They put two sentences, called conjuncts,
together and claim that they are both true. We’ll use the ampersand (&) to
signify a negation. Other common symbols are a dot and an upside down
wedge. The English words that are translated with the ampersand include:
• and
• but
• also
• however
• yet
• still
• moreover
• although
• nevertheless
• both
For example, we would translate the sentence ‘It is raining today and my
sunroof is open’ as ‘R&O’.
4.3 Disjunction
A disjunction is an “or” sentence. It claims that at least one of two sentences,
called disjuncts, is true. For example, if I say that either I will go to the
movies this weekend or I will stay home and grade critical thinking homework,
then I have told the truth provided that I do one or both of those things. If I
do neither, though, then my claim was false.
We use this symbol, called a “vel,” for disjunctions: ∨. The vel is used to
translate - or - either. . . or - unless
42 CHAPTER 4. PROPOSITIONAL LOGIC
4.4 Conditional
The conditional is a common type of sentence. It claims that something is
true, if something else is also. Examples of conditionals are
• “If Sarah makes an A on the final, then she will get an A for the course.”
• “Your car will last many years, provided you perform the required
maintenance.”
• “You can light that match only if it is not wet.”
We can translate those sentences with an arrow like this:
• F →C
• M →L
• L → ¬W
The arrow translates many English words and phrases, including
• if
• if. . . then
• only if
• whenever
• when
• only when
• implies
• provided that
• means
• entails
• is a sufficient condition for
• is a necessary condition for
• given that
• on the condition that
• in case
One big difference between conditionals and other sentences, like conjunctions
and disjunctions, is that order matters. Notice that there is no logical
difference between the following two sentences:
• Albany is the capital of New York and Austin is the capital of Texas.
• Austin is the capital of Texas and Albany is the capital of New York.
They essentially assert exactly the same thing, that both of those conjuncts
4.4. CONDITIONAL 43
are true. So, changing order of the conjuncts or disjuncts does not change
the meaning of the sentence, and if meaning doesn’t change, then true value
doesn’t change.
That’s not true of conditionals. Note the difference between these two
sentences:
• If you drew a diamond, then you drew a red card.
• If you drew a red card, then you drew a diamond.
The first sentence must be true. if you drew a diamond, then that guarantees
that it’s a red card. The second sentence, though, could be false. Your
drawing a red card doesn’t guarantee that you drew a diamond, you could
have drawn a heart instead. So, we need to be able to specify which sentence
goes before the arrow and which sentence goes after. The sentence before the
arrow is called the antecedent, and the sentence after the arrow is called the
consequent.
Look at those three examples again:
1. “If Sarah makes an A on the final, then she will get an A for the course.”
2. “Your car will last many years, provided you perform the required
maintenance.”
3. “You can light that match only if it is not wet.”
The antecedent for the first sentence is “Sarah makes an A on the final.” The
consequent is “She will get an A for the course.” Note that the if and the
then are not parts of the antecedent and consequent.
In the second sentence, the antecdent is “You perform the required mainte-
nance.” The consequent is “Your car will last many years.” This tells us that
the antecedent won’t always come first in the English sentence.
The third sentence is tricky. The antecedent is “You can light that match.”
Why? The explanation involves something called necessary and sufficient
conditions.
something that must be true in order for something else to be true. Making
a 95 on an exam is not necessary for making an A—a 94 would have still
been an A. Taking the exam is necessary for making an A, though. You can’t
make an A if you don’t take the exam, or, in other words, you can make an a
only if you enroll in the course.
Here are some important rules to keep in mind:
• ‘If’ introduces antecedents, but Only if introduces consequents.
• If A is a sufficient condition for B, then A → B.
• If A is a necessary condition for B, then B → A.
4.5 Biconditional
We won’t spend much time on biconditionals. There are times when something
is both a necessary and a sufficient condition for something else. For example,
making at least a 90 and getting an A (assuming a standard scale, no curve,
and no rounding up). If you make at least a 90, then you will get an A. If
you got an A, then you made at least a 90. We can use a double arrow to
translate a biconditional, like this:
• N →A
For biconditionals, as for conjunctions and disjunctions, order doesn’t matter.
Here are some English phrases that signify biconditionals:
• it and only if
• when and only when
• just in case
• is a necessary and sufficient condition for
4.6 Translations
Propositional logic is language. Like other languages, it has a syntax and
a semantics. The syntax of a language includes the basic symbols of the
language plus rules for putting together proper statements in the language.
To use propositional logic, we need to know how to translate English sentences
into the language of propositional logic. We start with our sentence letters,
4.6. TRANSLATIONS 45
which represent simple English sentences. Let’s use three borrowed from an
elementary school reader:
T: Tom hit the ball.
J: Jane caught the ball.
S: Spot chased the ball.
We then build complex sentences using the sentence letters and our five logical
operators, like this:
We can make even more complex sentences, but we will soon run into a
problem. Consider this example:
T &J →S
T & (J → S)
(T & J) → S
If we need higher level parentheses, we can use brackets and braces. For
instance, this is a perfectly good formula in propositional logic:
Truth Tables
¬P
To the left of the formula, list the simple sentence letters in alphabetical
order. In this case, we only have one sentence letter.
P ¬P
49
50 CHAPTER 5. TRUTH TABLES
Now draw a horizontal line underneath all of that, and a vertical line separating
the formula from the sentence letters, like this:
P ¬P
P ¬P
T
F
Finally, fill in the truth values of the formula for each line, given the truth
values of the simple sentences on that line. Since the negation just changes
the truth value of the simple sentence, our truth table will look like this:
P ¬P
T F
F T
Now, let’s construct a truth table for a conjunction. Again, we’ll write the
formula at the top:
P & Q
We’ll then write the simple sentence letter to the left, and draw the lines.
5.1. SINGLE SENTENCES 51
P Q P & Q
Next, we need to write all the different possible combinations of truth values
of those simple sentence letters. First, they could both be true.
P Q P & Q
T T
P Q P & Q
T T
T F
P Q P & Q
T T
T F
F T
P Q P & Q
T T
T F
F T
F F
Now, we just fill in the rest. The conjunction is true when both conjuncts
are true, and false otherwise, So, the completed truth table looks like this.
P Q P & Q
T T T
T F F
F T F
F F F
Here is the truth table for the disjunction. Remember that disjunctions are
true when at least one disjunct is true, and false otherwise. So, the disjunction
is only false on the bottom line.
P Q P ∨ Q
T T T
T F T
F T T
F F F
This is what the truth table for the conditional looks like. Conditionals are
false whenever the antecedent is true and the conclusion is false, but they are
true any other time.
P Q P → Q
T T T
T F F
F T T
F F T
Finally, here is the truth table for the biconditional. Biconditionals are true
whenever both sides have the same truth value. That will be the first line,
5.1. SINGLE SENTENCES 53
where they are both true, and the last line, where they’re both false.
P Q P ↔ Q
T T T
T F F
F T F
F F T
Let’s do one that is slightly longer. Here’s a truth table for P & (Q ∨ R):
We’ll go ahead and write the formula and sentence letters, and draw the lines.
P Q R P & (Q ∨ R)
It gets more difficult to fill in the combinations of truth values for the sentence
letters as the tables get larger. Done one entire row at a time, it’s easy to
miss a combination. The best way is to do it an entire column at a time.
Start with the rightmost column, and alternate T’s and F’s.
P Q R P & (Q ∨ R)
T
F
T
F
T
F
T
F
54 CHAPTER 5. TRUTH TABLES
Then, move to the next column to the left. Here, alternate pairs of T’s and
pairs of F’s.
P Q R P & (Q ∨ R)
T T
T F
F T
F F
T T
T F
F T
F F
Maybe you can see the pattern now. We’ll then move to the next column and
put four T’s and four F’s.
P Q R P & (Q ∨ R)
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
Notice that we have eight rows. If there were four different simple sentences,
we’d have sixteen, thirty-two for five, and so on. The general formula is this:
if there are n simple sentences, then there will be 2n rows.
Next, we fill in the rest of the truth table. With longer tables, it can be easier
to first copy the columns of the sentence letters, like this:
5.1. SINGLE SENTENCES 55
P Q R P & (Q ∨ R)
T T T T T T
T T F T T F
T F T T F T
T F F T F F
F T T F T T
F T F F T F
F F T F F T
F F F F F F
P Q R P & (Q ∨ R)
T T T T T T T
T T F T T T F
T F T T F T T
T F F T F F F
F T T F T T T
F T F F T T F
F F T F F T T
F F F F F F F
Now, we can ignore the columns under Q and R. We’re focused on P and
the column under the disjunction symbol. To make it clear, I’ll remove the
others.
P Q R P & (Q ∨ R)
T T T T T
T T F T T
T F T T T
T F F T F
F T T F T
F T F F T
F F T F T
F F F F F
56 CHAPTER 5. TRUTH TABLES
Now, we complete the column for the conjunction. It’s true whenever P and
Q ∨ R are both true.
P Q R P & (Q ∨ R)
T T T T T T
T T F T T T
T F T T T T
T F F T F F
F T T F F T
F T F F F T
F F T F F T
F F F F F F
Ultimately, the column I’m really interested is the one underneath the main
connective. I’ll make it bold to be clear. Our complete truth table with all
the columns looks like this:
P Q R P & (Q ∨ R)
T T T T T T T T
T T F T T T T F
T F T T T F T T
T F F T F F F F
F T T F F T T T
F T F F F T T F
F F T F F F T T
F F F F F F F F
Notice that the column of the main connective has a mixture of T’s and F’s.
This is called a contingency. A contingent statement is true on some rows
and false on others. Some sentences are true on all rows. They are called
tautologies. Here is a simple example:
P P ∨ ¬P
T T T F
F F T T
P P & ¬P
T T F F
F F F T
P Q ¬ (P & Q) / ¬P ∨ ¬Q
T T F T T T F F F
T F T T F F F T T
F T T F F T T T F
F F T F F F T T T
It should be no surprise that those sentences are equivalent. The first one
essentially claims that it’s not the case that P and Q are both true, and the
second one claims that at least one of them is false. They are just two ways
of saying the same thing.
1. P → Q
2. P
3. Q
P Q (P → Q) / P // Q
Then fill in our possible truth values for the simple sentences on the left.
P Q (P → Q) / P // Q
T T
T F
F T
F F
We can easily fill in the columns for the second premise and the conclusion,
since they involve just copying over the P and Q columns.
P Q (P → Q) / P // Q
T T T T
T F T F
F T F T
F F F F
Finally, we’ll fill in the column for the first premise. Remember that a
conditional is false only when the antecdent is true and the consequent is
false. So, the first premise is false on the second line, and true on the other
lines.
5.3. TRUTH TABLES AND VALIDITY 59
P Q (P → Q) / P // Q
T T T T T
T F F T F
F T T F T
F F T F F
Now, what tells us that the argument is valid? Remember that an argument
is valid if it is impossible for the premises to be true and the conclusion to be
false. So, we check to see if there is a row on the truth table that has all true
premises and a false conclusion. If there is, then we know the argument is
invalid. In this argument, the only row where all the premises are true is the
line 1. On that line, however, the conclusion is also true. So, this argument
is valid.
There’s often no need to fill out the whole truth table to determine validity.
Let’s look at shortcut, using the same argument. I can see immediately that
there is really only one row that I need to work. See if you can figure out
which one it is.
P Q (P → Q) / P // Q
T T
T F
F T
F F
I only need to focus on rows where I know the premises might be true or the
conclusion might be false. So, I can safely ignore rows 3 and 4, because the
second premise is false on those rows. When I look at rows 1 and 2, I see
that the conclusion is true on line 1. So, the only row that has a chance of
showing this argument to be invalid is row 2. So, I’ll work that one.
P Q (P → Q) / P // Q
T T
T F F T F
F T
F F
60 CHAPTER 5. TRUTH TABLES
After working it, I see that one of the premises turned out to be false. So, I
know there’s no row that has all true premises and a false conclusion.
Now, let’s see what happens when we switch the second premise with the
conclusion. On which rows do you think we should focus?
P Q (P → Q) / Q // P
T T
T F
F T
F F
Notice that the conclusion is false only on rows 3 and 4. On row 4, though,
the second premise is false. So, the only row that could make this invalid is
row 3. Let’s work it and see what results.
P Q (P → Q) / Q // P
T T
T F
F T T T F
F F
Since a conditional with a false antecedent is true, the first premise if true on
line 3. The second premise is also true, but the conclusion is false. So, this
argument is invalid. In fact, this is such a common invalid argument that it
has a name: “Assuming the Consequent.”
Here is another example:
1. P → Q
2. ¬ Q
3. ¬ P
P Q (P → Q) / ¬Q // ¬P
T T
T F
F T
F F
5.3. TRUTH TABLES AND VALIDITY 61
P Q (P → Q) / ¬Q // ¬P
T T T F F
T F F T F
F T T F T
F F T T T
There is no line with all true premises and a false conclusion, so the argument
is valid. This argument type is called by the Latin name, Modus Tollens. Let’s
again switch the second premise and the conclusion, and see what happens.
P Q (P → Q) / ¬P // ¬Q
T T T F F
T F F F T
F T T T F
F F T T T
The third line has all true premises and a false conclusion, so this argument
is invalid. This is called “Denying the Antecedent.”
Let’s try a truth table for a more complex argument.
1. AvB
2. A → (B v C)
3. ¬(C & A)
4. B
The table begins like this:
A B C A ∨ B / A → (B ∨ C) / ¬ (C & A) // B
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
62 CHAPTER 5. TRUTH TABLES
I’ll talk you through the first line, then just fill out the rest. On the first line,
since A and B are both true, the first premise is true. The second premise
is a conditional with a true antecdent and a true consequent (B and C are
both true, making B ∨ C true). So, the second premise is also true. The
third premise is false, since it is a negation of a true conjunction. Finally, the
conclusion is true.
A B C A ∨ B / A → (B ∨ C) / ¬ (C & A) // B
T T T T T T T T T T T F T T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
A B C A ∨ B / A → (B ∨ C) / ¬ (C & A) // B
T T T T T T T T T T T F T T T T
T T F T T T T T T T F T F F T T
T F T T T F T T F T T F T T T F
T F F T T F T F F F F T F F T F
F T T F T T F T T T T T T F F T
F T F F T T F T T T F T F F F T
F F T F F F F T F T T T T F F F
F F F F F F F T F F F T F F F F
There is no line with all true premises and a false conclusion, so the argument
is valid.
careless mistakes, you’re guaranteed to get the right answer. The only
drawback is that they get very large, very quickly. A truth table for an
argument with six simple sentences in it has 64 rows—not something that
most of us would look forward to doing.
It would be nice if there was a way that we could go straight to the row that
showed an argument to be invalid, if there was one. Fortunately, there is,
although it can be tricky at times.
Let’s try this argument:
1. A & B
2. ¬ [A → (C v D)]
3. C v D
The first step is to set up the truth table as we’ve done in the past, but we’ll
only need one row.
A B C A & B / ¬ [A → (C ∨ D)] // C ∨ D
The next step is to put a ‘T’ underneath the main operator of all the premises
and a ‘T’ under the main operator of the conclusion.
A B C A & B / ¬ [A → (C ∨ D)] // C ∨ D
T T F
When we do this, we’re assuming that there is a line on which all of the
premises of the argument are true and the conclusion is false. Now, we’ll see
if that assumption leads to a contradiction. If it does, then there can’t be a
line like that, and the argument is valid. If it does not lead to a contradiction,
then there will be a line like that, and the argument will be invalid.
Now, we’ll start filling in what must be true if our assumptions are correct.
The first premise is a true conjunction, so both conjuncts must be true.
A B C A & B / ¬ [A → (C ∨ D)] // C ∨ D
T T T T F
64 CHAPTER 5. TRUTH TABLES
A B C A & B / ¬ [A → (C ∨ D)] // C ∨ D
T T T T F F F
Now, we know what A, B, C, and D have to be. Let’s transfer those values
to the second premise.
A B C A & B / ¬ [A → (C ∨ D)] // C ∨ D
T T T T T F F F F F
Now, we need to finish completing the second premise. We’ll start with the
disjunction in the antecedent of the conditional.
Then, the conditional itself:
Now, we check to see if there were any problems. We’re looking for something
like a letter that has different truth values, or a false disjunction with a true
disjunct. Here, each letter has the same truth value wherever it occurs. We
have a conjunction with two true conjunctions, two false disjunctions, both
with two false disjuncts, a false conditional with a true antecedent and a false
consequent, and a true negation with a false negated sentence. Everything
looks fine, which means it is possible for the argument to have true premises
and a false conclusion, and is definitely invalid. The problem row would be
the one where A is true, B is true, C is false, and D is false. That would be
row 4 of the entire truth table.
Let’s try another. Here is a classic argument called a constructive dilemma:
1. A B
2. C D
3. AvC
4. BvD
Start by constructing the basic table heading.
A B C D A → B / C → D / A ∨ C // B ∨ D
5.4. SHORT TRUTH TABLES 65
Then, fill in T and F under the main connective of the premises and conclusion,
respectively.
A B C D A → B / C → D / A ∨ C // B ∨ D
T T T F
Then, we’ll fill in what we can figure out, given those assumptions. We don’t
know anything about the premises yet. The first two are true conditionals,
and there are three different ways a conditional can come out true. Likewise
for the true disjunction in the third premise. So, let’s start with the conclusion.
Since it is a false disjunction, then both B and D must be false.
A B C D A → B / C → D / A ∨ C // B ∨ D
T T T F F F
A B C D A → B / C → D / A ∨ C // B ∨ D
T F T F T F F F
Now, we can do the first two premises. Notice that we have true conditionals
with false consequents. That means that both of the antecedents must be
false.
A B C D A → B / C → D / A ∨ C // B ∨ D
F T F F T F T F F F
Now, we can fill that in where A and C occur in the third premise.
A B C D A → B / C → D / A ∨ C // B ∨ D
F T F F T F F T F F F F
5.5.1 Valid
Modus Ponens
1. P → Q
2. P
3. Q
Modus Tollens
1. P → Q
2. ¬ Q
3. ¬ P
Disjunctive Syllogism
1. A v B
2. ¬ B
3. A
Hypothetical Syllogism
1. A B
2. B C
3. A C
Constructive Dilemma
1. A B
2. C D
3. AvC
4. BvD
Destructive Dilemma
1. A B
2. C D
3. ¬B v ¬ D
5.5. ARGUMENT FORMS 67
4. ¬A v ¬ C
5.5.2 Invalid
Affirming the Consequent
1. P → Q
2. Q
3. P
Denying the Antecedent
1. P → Q
2. ¬ P
3. ¬ Q
68 CHAPTER 5. TRUTH TABLES
Chapter 6
Sense Perception
69
70 CHAPTER 6. SENSE PERCEPTION
and tasting seem effortless and automatic to us, yet the processes behind
those tasks are unbelievably complex. Learning about those processes will
help us to understand when they work well and when they sometimes deceive
us. We will focus on vision, but many of the issues related to vision apply to
the other senses as well.
When we take our senses for granted, we risk making two mistakes. First, we
don’t appreciate how amazing they are. In what is called a rapid serial visual
presentation test (RSVP), test subjects are shown a series of pictures at a
rate of about 10 per second. (If you were taking the test, you would have
seen about fifty pictures in the time that it took you to read this sentence.)
After several repetitions of the series, the test subject is asked to write down
what she saw. Even though the images are presented at an unbelievably
fast rate, most people can remember almost all of the pictures in the series.
Whenever you start to feel disappointed in your abilities, think about this
— scientists have not found any information processing systems that can do
these operations as fast as your brain. The world’s fastest supercomputer
just can’t keep up with you when doing these complex tasks. Your brain can
do some unbelievably complex tasks, and do them amazingly well. That’s
the good news.
Now, for the bad news. . . the second mistake we make when we take our
senses for granted is to be overconfident in their accuracy. The reason that
our brains can do those difficult tasks at the speed that they do is because
they receive sensory input, then basically make educated guesses about the
world around us. We can demonstrate this with a simple experiment called
the blind spot test. Take a blank piece of paper, draw a dot on the left side,
and an X on the right. Make them about 4-5 inches apart. Now, hold the
paper in your hand and extend your arm in front of you. Cover your left
eye, and focus on the dot with your right eye. You should see the X in your
peripheral vision. Now, slowly move the paper toward you. At some point,
the X will vanish, then reappear as you continue to bring the paper closer to
you.
What has happened? Basically, each eye has a blind spot where the optic
nerve attaches to the retina. When you can’t see the dot, it’s because it is in
the blind spot. Why do we not just have a hold in the visual field? Why do
we see a solid sheet of paper? It’s because the brain makes a guess: it decides
that what is in the blind spot is probably like what is in the area around
72 CHAPTER 6. SENSE PERCEPTION
it. Your brain made a guess — a better way to state this it that it made an
inference from the data surrounding the blind spot. These inferences are fast,
automatic, and outside our conscious awareness. Very often, they are correct,
but sometimes, occasionally tragically so, they get it wrong.
output. Then, perceptual constancies teach us that we can have the same
output for different inputs. That is, sameness of input is not necessary for
sameness of output.
Ambiguous figures teach us something else, that we can have the same input
with different outputs, or that sameness of input is not sufficient for sameness
of output. A classic case, one that you are probably familiar with, is called
the Necker Cube:
The interesting thing about the Necker cube is that we can, at will, change
which side of the cube faces front. That is, we can change the way the image
looks to us in our minds, although we know that the printed image on the
page is not changing. Here, we have same inputs with different outputs. So,
sameness of input is not sufficient for sameness of output. That is, the same
sensory input does not guarantee that we will see the same thing.
.images/abc123.pdf
Here we have an ambiguous figure in the center, which could either be the
letter “B” or a “13”. You can see how a viewer would report seeing a “B”
in one context, and a “13” in another. There’s a sense in which what was
seen would not change, but how the experience would be interpreted certainly
would. There are plenty of more familiar cases of times that our perceptual
set affects what we see:
• Have you ever proof-read an essay that you wrote and found no mistakes,
just to have a friend look it over and instantly see a host of spelling and
typographical errors?
• Have you ever yelled at a friend that you saw in the distance just to
find out that it was a stranger who looked nothing like your friend?
We’ll discuss other examples in class. The point is that there are factors that
influence the way we see the world. We should always be aware of how much
these our influencing us, and careful not to naively trust our senses beyond
what they deserve.
Chapter 7
Memory
In the last chapter, we discussed the potential problems with sense perception
as a source of information. In this chapter, we’ll do the same for memory.
Although the details differ, the main problem with both perception and
memory is the same. That is, they are active, not passive. Memory is not
like a machine that simply records what happened. Our memory adds new
information, fills in the gaps, revises what was remembered, and invents new
information.
7.2 Retrieval
There are two important types of retrieval. The first is recall. This is what
happens in most instances when you are trying to remember something. For
example, remembering someone’s name, answering an essay question on an
exam, and describing what someone looks like are all examples of recall.
75
76 CHAPTER 7. MEMORY
Recognition is when you see the thing you remember and are able to recognize
it as the thing remembered. For example, seeing a friend that you haven’t
seen in years and recognizing her as your friend would be an instance of
recognition. Answering a multiple choice question is also recognition. The
answer is right there in front of you, all you need to do is recognize it as the
answer.
Retrieval is context dependent, state dependent, and mood congruent. Con-
text dependence means that a person will tend to remember information when
they are in the same context as when they initially learned that information.
For example, students can recall information on a test more easily when
they are taking the test in the same room in which they initially learned the
information.
State dependence means that information is more likely to be remembered
when the subject is in the same psychological state as when the information
was initially learned. These states included synthetic states of consciousness
induced with certain drugs (as mild as caffeine), or moods.
Mood-congruence means that when in a certain mood, subjects will tend to
remember things that match that mood. For example, if a person is feeling
depressed, they will tend to remember depressing things, while if happy, they
will tend to remember happy things.
was Ronald Reagan, who repeatedly told a story about a pilot who heroically
went down with his plane in World War II. The scene, though, was actually
from a film called A Wing and a Prayer.
There are two particular dangers caused by source misattribution. The first is
plagiarism. A person might think that the idea is their own, but, in reality, he
heard it from another person. The second danger is in believing information
to have a higher degree of credibility that it really does. Someone might
believe that she learned the information from a credible source, but actually
she learned it from someone who she wouldn’t really trust.
8.1 Expertise
We should ask the person who is likely to know the answer, that is, the expert.
We will define expertise very generally — an expert is someone who knows
more about a field than most people do. This does not mean that an expert
is always right. Experts are certainly not foolproof. Expertise also comes in
degrees. There could be a person that knows more than the average person
and another person that knows much more than the average person. The
first is an expert, but the second has a higher degree of expertise. The final
thing to keep in mind is that expertise is always in a field. If the claim is
outside the expert’s area of expertise, then there is not reason to think that
she knows any more than the average person on the subject.
79
80 CHAPTER 8. OTHER PEOPLE AS SOURCES OF INFORMATION
Informal Fallacies
Good critical thinkers are persuaded by relevant cognitive content, and are
not unduly persuaded by irrelevant emotive content.
83
84 CHAPTER 9. INFORMAL FALLACIES
9.2 Slanters
Slanters are words or phrases that are used to manipulate by using emotive
language. Slanters can have both positive and negative connotations. Slanters
are types of non-argumentative persuasion. Sometimes, people will use them
innocently, maybe because they have passionate feelings about the subject
being discussed. Other time, though, they are used because the speaker
knows that he does not have a good argument for his position. They are
ways for people to affect the beliefs of others without offering reasons for their
positions.
• Egghead
• Worm food
• Pig
• Dead tree edition
9.2.2 Innuendoes
Innuendoes imply something by what is not said. A common scene in crime
films has a gangster go into a store and say something like “Nice store you
got. It would be a shame if anything happened to it.” Notice that he didn’t
actually say he would damage the store, although he certainly implied it.
Another use of an innuendo is to condemn with faint praise. Imagine receiving
a reference letter for a student applying to graduate school. The letter only
says that the student was never late to class. The implication is that her
punctuality is the best that can be said of her.
Finally, there is the apophasis, which is mentioning something by saying that
it won’t be mentioned. For example, “I’m not going to talk about your failure
to turn assignments in on time.”
9.2.3 Weaselers
A weaseler is a way of qualifying a claim in order to avoid criticism. Weaselers
include words and phrases like “perhaps,” “there’s a good chance that,” and
“it’s possible that.” A weaseler that is common in advertising is “up to” —
“By using our diet plan, you can lose up to ten pounds in a month.” Notice
that “up to ten pounds” means “no more than ten pounds.” So, if a customer
loses no weight at all, then there is no grounds for a lawsuit.
9.2.4 Downplayers
A downplayer is a way of making something seem less important than it is.
The most common downplayers are “mere, merely, and so-called.” A person
might say, “That’s merely your opinion” to avoid having to respond with facts.
A politician might talk about his opponent’s “so-called” plan to cut spending,
implying that it isn’t much of a plan at all. Improper use of quotation marks
can also serve as a downplayer.
86 CHAPTER 9. INFORMAL FALLACIES
9.2.6 Hyperbole
Hyperbole is an inappropriate or extreme exaggeration. “Taking critical
thinking is the most exciting thing you’ll do in your whole life!” Since it is
an extreme exaggeration, no one will be fooled into believing it, so what’s
the danger? The danger of hyperbole is that once the exaggeration is made,
the listener is then prepared to accept a weaker version of the statement.
The weaker version, compared to the extreme exaggeration, sounds more
believable.
9.3.1 Equivocation
The fallacy of equivocation is committed by using the same term in two
different senses in the same argument. Here is my favorite example:
1. God is love.
2. Love is blind
3. Ray Charles is blind.
4. Ray Charles is God.
There are several things wrong with this argument, one of them is equivocating
on “blind.” To say that love is blind, is to say that people overlooks the faults
9.3. FALLACIES OF AMBIGUITY AND VAGUENESS 87
of those they love. To say that Ray Charles is blind is to say that he cannot
physically see anything, not that he just overlooks things.
9.3.2 Amphiboly
Amphibolies rely on syntactic ambiguities. Those are ambiguities that result
from the arrangement of the words. Church bulletin bloopers are good places
to find amphibolies: “The Rev. Adams spoke briefly, much to the delight of
his audience.”
9.3.3 Accent
The fallacy of accent is an equivocation resulting from accenting different
words in a sentence. Think about the different meanings that are implied from
accenting different words in this sentence: “I didn’t take the exam yesterday.”
9.4.1 Ad Hominem
The Ad Hominem fallacy is committed by attacking the person giving the
argument, rather than responding to the argument itself. There are four
common types:
9.4.1.3 Tu Quoque
A person’s behavior may very well be inconsistent with their argument, but
that doesn’t mean that the argument is bad.
Poisoning the well is an ad hominem committed before the arguer has spoken.
The goal is to provide harmful information about the speaker to preemptively
discredit anything that the speaker might say. Any of the previous examples
can be turned into examples of poisoning the well. For example: “John is
about make his case for increasing the church’s youth budget. Don’t pay any
attention to him — he’s the youth minister, what else would he say?”
9.4.4.1 Bandwagon
The bandwagon fallacy tells the listener that since everyone does, or believes,
something, then they should too.
Example: “Everyone supports Smith for president. You need to get with the
program and support him too!”
argument more extreme than it actually is, since extreme views are often easy
to attack.
Notice the original isse is whether smoking has bad health consequences. By
the end of the paragraph, the issue has been changed to the economic impact
of making smoking illegal.
the person is cheating. Notice that there is no way to directly answer the
question without admitting to cheating on exams.
Probability
Students tend to find these two chapters on probability the most difficult
material in the course. It looks hard, but it’s really not as complicated as
it looks. It is important to understand how probabilities work in order to
reason well. We rarely have conclusive evidence for or against any claim.
Imagine that you’re on a jury trial, you have been tasked with determining
the probability of the defendant’s guilt given the evidence. To do this well
requires that a person have a basic understanding of how probability works.
Given the example about serving on a jury, it’s more than a little disturbing
that our intuitions about probabilities are extremely flawed. Here’s a classic
example called the Monty Hall Problem: In the game show Let’s Make a
Deal, the host, Monty Hall, would select a person to play for the big prize.
The contestant would have a choice of three doors. After choosing a door, the
host, who knows which door the prize is behind, would open one of the other
doors and show the contestant that that door did not reveal the prize. The
contestant would then be offered the choice to stick with his original choice
or to switch to the third door.
So, you are the contestant. You choose door number 1. Let’s say that Monty
opens door 2 and shows you that it has nothing behind it. What should
you do? Stick with 1 or switch to 3? You should do what will increase
the probability of your winning. Which has the higher probability? Most
people will answer that, since there are only two doors, neither has a higher
probability than the other. So, the common answer goes, the odds of your
97
98 CHAPTER 10. PROBABILITY
favorable outcomes
Pr(A) =
total possible outcomes
That’s easy enough. We just have to determine how many possible ways this
scenario could work out, and how many of those ways get us the outcome
that we’re looking for.
10.3. CALCULATING COMPLEX EVENTS 99
10.2.1 Examples
What is the probability of tossing heads with a single coin? If we toss a coin
once, there are only two possible outcomes (to keep things simple, we rule
out the very, very slim possibility that it lands and stays on edge). Of those
two outcomes. only one is heads. So, the probability of tossing heads is equal
to 1/2. In probability notation, Pr(H) = 1/2
What is the probability of rolling two on one roll with a single die? There are
six possible outcomes, only one is a two. Pr(2) = 1/6
What is the probability of drawing the Ace of Spades on one draw from
a deck of cards? There is one favorable outcome out of 52 total possible:
Pr(A♠) = 1/52
What is the probability of drawing an Ace on a single draw? Now there are
four favorable outcomes in the 52 total possible: Pr(A) = 4/52 = 1/13
There are also some symbols that you need to know. “Not” is symbolized by
“¬” and “and” is symbolized by “&”
10.3.2 Negations
Now, let’s pause and think for a moment. Remember that the probability
of an event that must occur is equal to one. For any event, it must be the
case that some outcome occurs. For example, if you toss a coin, you have
to get either heads or tails. So, if you add up the probabilities of all the
possible outcomes for an event, they have to add up to 1. Now, let’s imagine
an event that has three possible outcomes, A, B, and C. By our reasoning,
Pr(A) + Pr(B) + Pr(C) = 1. That is, we can think of the probability of an
event as represented by a big pie. Each possible outcome is a piece of the pie.
The size of the whole pie is 1, so when we add up the areas of each the pieces,
they have to total 1. Now, let’s I want to know the probability of ¬A. The
probability of A is just the size of A in the pie. The probability of ¬A then
is the size of the remainder of the pie, once we take out A. Since the size of
all of the pieces add up to 1, the probability of A not occuring is equal to
1 − Pr(A). Thus, we get the negation rule:
Pr(¬S) = 1 − Pr(S)
For example, what is the probability of not rolling a 6 on one roll of a die? It
must be equal to 1 minus the probability of rolling a six. Since there a six
sides, the probability of rolling a six equals 1/6. So, Pr(¬6) = 1 − 1/6 = 5/6
10.3. CALCULATING COMPLEX EVENTS 101
10.3.3 Compatibility
Two statements are compatible if they can both be true, and two events are
compatible if they can both occur. There are certain events such that one’s
occurring automatically rules out the other’s occurring. For example, if I get
heads on one coin toss, that means that I didn’t get tails. There’s no way
for both of those to occur on the same toss. They are incompatible events.
Other events are compatible. Let’s say I draw one card from a deck. Can I
get both a King and a Heart? Yes, if I get the King of Hearts. So, getting a
King and getting a Heart on the same draw are compatible events.
So, compatible or incompatible?
1. Tossing heads on one coin toss and tossing tails on the same toss.
Incompatible
2. Tossing heads on one toss and tossing tails on the next. Compatible.
3. Drawing the ace of spades on both of two draws, if
4. The first card is put back into the deck (with replacement). Compatible
5. The first card is not put back into the deck (without replacement).
Incompatible
draw them (called with replacement). Card draws are dependent if the cards
are not placed back in the deck (without replacement).
Here are some examples. What is the probability of getting heads on two
consecutive tosses? That means getting heads on the first toss and heads
on the second toss. The two are independent events, so Pr(H1&H2) =
Pr(H1) × Pr(H2) = 1/2 × 1/2 = 1/4.
What’s the probability of getting a king on two consecutive draws with
replacement? Again, these are independent events. Pr(K1&K2) = Pr(K1) ×
Pr(K2) = 1/13 × 1/13 = 1/169.
104 CHAPTER 10. PROBABILITY
Chapter 11
Conditional Probabilities
Pr(A&B)
Pr(A|B) =
Pr(B)
This formula is rarely used. It’s usually only necessary to think in terms of
favorable outcomes over total possible. Conditional probabilities change one
or more of these outcomes. For example, you draw a king from a standard
deck, keep it, and draw a second card. What is the probability of getting a
king on your second draw given that you got a king on the first draw? That
105
106 CHAPTER 11. CONDITIONAL PROBABILITIES
is, what is Pr(K2|K1)? Now there are 51 total cards, three of which are
kings. So, it is 3/51.
You roll a die and it goes off table. Your friends tells you that it’s an
even number, but you can’t see. Given this extra information, what’s the
probability that you got a 2? Now, you can eleimate all of the odd numbers.
So, your only possibilities are 2, 4, and 6. So, the probability of rolling a two
given that you rolled an even number is 1/3.
Now, we can add one more conjunction rule:
Draw two cards from a full deck and don’t replace the first card before drawing
the second. What is the probability of drawing two Kings? Pr(K1&K2) =
Pr(K1) × Pr(K2|K1) = 1/13 × 3/51 = 1/221
A and B are independent events just in case Pr(A) = Pr(A|B). This is just
what you would expect. In this case, the extra information that B is true
did not change the probability of A. This can only be the case if B makes no
difference, in other words, they are independent.
11.2.2 Negations
Pr(¬A) = 1 − Pr(A)
11.2.3 Disjunctions
Pr(A or B) = Pr(A) + Pr(B) (Incompatible Events)
11.3. ODDS 107
11.2.4 Conjunctions
Pr(A & B) = Pr(A) × Pr(B) (Independent Events)
11.3 Odds
Odds and probabilities are different, but closely related. Probabilities are
numbers between 0 and 1. Odds are not numbers, but ratios between two
numbers. Odds are defined as the ratio of favorable outcomes to unfavorable
outcomes. The top number will always be the same in probabiliteis and odds.
The bottom number will be smaller for the odds than for the corresponding
probability.
5 dollars you won’t. If you both bet these amounts, over the long run you
both tend to break even. Since the probability of rolling a two is 1/6, you
should expect to win one out of every six times. On that time that you win,
you’ll win five dollars. Of course, you’ll lose the other five times, and will
lose a dollar each time. So, in six turns, you should expect to win five dollars
and lose five dollars. Notice how this follows naturally from the odds. The
odds of rolling a two are 1/5. If the person betting that the event will occur
bets the top number and the other person bets the bottom, it’s a fair bet.
Gamblers call such a bet an even-up proposition.
Casinos couldn’t turn a profit with even-up bets. So, you will never get a
fair bet in a casino. The house essentially takes a percentage of the winnings.
They do this by paying the winners less than the actual odds would require.
A good example is roulette. A roulette wheel has 38 compartments: 1-36,
0 and 00. You bet the ball will land on number 10. The probability that
the ball lands on number 14 is 1/38. So, the odds of the ball landing on 14
are 1/37. If you win, the house should be willing to pay you 37 dollars on
a one dollar bet. At these odds, the true odds, you break even. The house,
though doesn’t pay according to the true odds, they pay according to house
odds. The house odds pretend that the 0 and 00 squares aren’t there. So, as
far as the house is concerned, the odds of your winning are 1/35. The pay
35 dollars when, in fairness, the winner deserves 37 dollars. Another way of
stating this is that they are taking two dollars of your 37 dollar winnings, a
percentage of 2/37 or 5.4%. Now, since they are taking two dollars of your
winnings every time, you will lose in the long run.
Chapter 12
Bayes’ Theorem
12.1 Introduction
Now that you have an idea of how simple, complex, and conditional probabil-
ities work, it is time to introduce a new formula called Bayes’ Theorem. This
formula, although a bit more complicated than the others, can be incredibly
useful. Sometimes, we know the probability of A given B, but need to know
the probability of B given A. Bayes’ Theorem provides a way of converting
one to the other.
For example, imagine that you have recently donated a pint of blood to your
local blood bank. You receive in the mail a letter informing you that your
blood has tested positive for HIV antibodies. The letter informs you that you
could have AIDS. How worried should you be?
You need to know the probability that you have the disease given a positive
test for the disease, or Pr(D|+). Now, if you contact the company that
produces the test, they will be glad to give you some information about the
test. Each test has certain true positive, false positive, true negative, and
false negative rates. These rates have been determined by extensive testing.
The true positive rate is the percentage of times that the test will correctly
identify the samples that have the disease. The false positive rate is the
percentage of times that the test will say that the disease is present when it
really is not. The true negative rate is the percentage of times that the test
109
110 CHAPTER 12. BAYES’ THEOREM
says negative when the #ject does not have disease. The false negative rate
is the rate of positive tests when the #ject did not have the disease.
In terms of probabilities, it looks like this:
True Positive: Pr(+|D) False Positive: Pr(+|¬D) True Negative:
Pr(−|¬D) False Negative Pr(−|D)
If you know the true positive rate and the true negative rate, you can figure
out the other two. The false negative rate is equal to one minus the true
positive rate, and so on.
The blood bank is concerned about contamination of the blood supply. There-
fore, they want a test that has a false negative rate of zero. They aren’t as
concerned about the false positive rate, though. They don’t want a high false
positive rate, because then they would end up throwing out blood that was
just fine. If they have to needlessly dispose of a few pints out of the many
that they receive, though, it’s no great loss. The other thing they need is an
inexpensive test. They have to test every single donation, so the test they use
must be one they can afford. It turns out that tests with good false negative
rates are fairly inexpensive, but tests with low false positive rates are not.
The blood bank takes the cheaper test, because it adequately keeps the blood
supply safe, even though a few donations test positive that really were not
contaminated.
So, the blood bank gives you the false positive rate: Pr(+|¬D), but you need
to know Pr(D|+). What do you do? You use Bayes’ Theorem.
Pr(A) × Pr(B|A)
Pr(A|B) =
Pr(B)
Pr(A) × Pr(B|A)
Pr(A|B) =
Pr(A) × Pr(B|A) + Pr(¬A) × Pr(B|¬A)
12.3. EXAMPLES 111
Believe it or not, it’s often easier to use the expanded version than the shorter
version. In fact, you will very rarely use the shorter version. It’s generally
easier to just automatically begin working the problem with the longer version.
12.3 Examples
Let’s look at some examples, beginning with a very easy one. This is a problem
that you wouldn’t need the formula to solve, but it helps us understand how
the formula works.
1. What is the probability that a card is a heart given that it is red?
We know that the answer to this problem is 1/2. Half of the red cards are
hearts. Just to get used to the formula, we’ll solve it using Bayes’ Theorem:
Pr(H) × Pr(R|H)
Pr(H|R) =
Pr(R)
Since, 1/4 of all cards in a deck are hearts, Pr(H) = 1/4. All hearts are red,
so Pr(R|H) = 1, and half of the cards are red, so Pr(R) = 1/2.
So,
Pr(H) × Pr(R|H)
Pr(H|R) =
Pr(R)
1
4
×1
= 1
2
1
4
= 1
2
1
=
2
Pr(H) × Pr(R|H)
Pr(H|R) =
Pr(H) × Pr(R|H) + Pr(¬H) × Pr(R|¬H)
112 CHAPTER 12. BAYES’ THEOREM
The only additions are the probability that a card is not a heart, which is 3/4;
and the probability that a card is red, given that it is not a heart, which is
1/3 (If we don’t include the hearts, there are three suits, one of which is red).
So,
Pr(H) × Pr(R|H)
Pr(H|R) =
Pr(H) × Pr(R|H) + Pr(¬H) × Pr(R|¬H)
1
4
×1
= 1
3 1
4
×1 + 4
× 3
1
4
= 1 1
4
+ 4
1
=
2
Now, for a more difficult one. Here’s a question you might remember from
the pre-test:
The probability that a cab is blue is 0.85, and the probability that it is green
is 0.15. The probability that Wilbur will say it is green if it is in fact green is
0.80. The probability that Wilbur will not say it is in green if it is in fact
green is 0.20. Symbolized, if G = “The cab was green” and W = “Wilbur
says the cab was green”, this is Pr(G) = .15, Pr(¬G) = .85, Pr(W |G) = .80,
and Pr(W |¬G) = .20.
One current estimate that I read is that one million people in the USA now
have AIDS. The most recent census reports the population as 304,059,724.
This means that the base-rate, or the percentage of the population that has
AIDS is 0.32%. False-positive rates for the most common, low-cost, AIDS
test vary. They range from from 50% to 90%. A more expensive test, the
Western Blot test appears to have a false positive rate of 4.8% of Western
blood donors.
Pr(D) × Pr(+|D)
Pr(D|+) =
Pr(D) × Pr(+|D) + Pr(¬D) × Pr(+|¬D)
Let’s go with the base-rate of .32%. So, Pr(D) = .0032. We’ll also assume
the more expensive test, so Pr(+|¬D) = .048. Let’s also assume that the test
is very good at catching all cases of the disease, so Pr(+|D) = 1.
114 CHAPTER 12. BAYES’ THEOREM
Pr(D) × Pr(+|D)
Pr(D|+) =
Pr(D) × Pr(+|D) + Pr(¬D) × Pr(+|¬D)
.0032 × 1
=
(.0032 × 1) + (.9968 × .048)
.0032
=
.0032 + .0478
.0032
=
.051
= .063
So, assuming these numbers, there is only a 6.3% chance that you have AIDS
given that you got a positive test for the disease, and this is assuming that
the Western Blot was used and not the ELISA test, which has a much worse
false-positive rate! There are more expensive and reliable ways to test for the
disease, so if a person gets a positive result on one of these screening tests,
they should not panic, but get the more expensive test. There have been
tragic reports of people committing suicide because they got a positive result
on one of the initial screening tests.
12.5 Hints
As with other probability problems, once the right numbers are plugged into
the right formula, then the answers are generally easy to find. The most
common problem is finding the right values in what looks like a complex
paragraph.
Here’s an example conditional probability problem requiring Bayes’ Theorem:
1% of OBU students are philosophy majors. 90% of OBU phi-
losophy majors are accepted into their preferred graduate pro-
gram. 30% of OBU non-philosophy majors are accepted into
their preferred graduate program. Jane is an OBU student that
was accepted into her preferred graduate program. What is the
probability that she is a philosophy major?
Let, P = “An OBU student is a philosophy major” and A = “An OBU student
was accepted into her preferred graduate program.”
12.5. HINTS 115
The first step is to determine the conditional probability that the problem is
asking us to solve. The first part is generally easy, just look for the question.
In this case, “What is the probability that she is a philosophy major?” To
find the given, look for the one thing that is known for certain; it won’t
be a probability or percentage. We know that she was accepted into her
preferred graduate program. So, we want to know the probability that Jane
is a philosophy major given that she was accepted into her preferred graduate
program, or Pr(P |A). Once that is determined, then simply write out the
formula:
Pr(P ) × Pr(A|P )
Pr(P |A) =
Pr(P ) × Pr(A|P ) + Pr(¬P ) × Pr(A|¬P )
Now, we have to find the numbers to plug into the formula. Many, if not
most, of the problems are stated in terms of percentages. The probability of
A given B is a function of the percentage of B’s that are A’s. That is, if A’s
comprise half of the B’s, then Pr(A|B) = 0.5
So,
1. Pr(A|P ) = 0.9
2. Pr(A|¬P ) = 0.3
3. Pr(P ) = .01
Pr(P ) × Pr(A|P )
Pr(P |A) =
Pr(P ) × Pr(A|P ) + Pr(¬P ) × Pr(A|¬P )
.01 × .9
=
(.1 × .9) + (.99 × .03)
.009
=
.009 + .0297
.009
=
.0387
= .258
116 CHAPTER 12. BAYES’ THEOREM
Chapter 13
Applying Probabilities
117
118 CHAPTER 13. APPLYING PROBABILITIES
1 5 5 1
EV = × 6 + × −1 = 1 − =
6 6 6 6
That is, when playing this game, you should expect to come out ahead 16 of a
dollar, or nearly 17 cents, each time you plan. Obviously, no casino will offer
a game like this.
13.3. FOUR COMMON MISTAKES 119
There are other, non-gambling, applications for expected value. Some stan-
dardized exams discourage guessing by assessing a penalty for every wrong
answer. So, imagine you are taking such an exam, and you come to question
32, a multiple choice question with four options. You have no idea which is
correct, and would have to guess. If you guess correctly, you get one point, if
you guess incorrectly, you lose $5 12of apoint.Shouldyouguess?Itdependsontheexpectedvalue.
1/4 3 5 3
EV = 1+ ×− =−
× 4 12 48
Since, the expected value is negative, guessing is not in your best interests.
Now, imagine that on the next question, you still don’t know which option
is correct, but you know that it can’t be the first one. The payoffs are the
same, but the probabilities have now changed.
1/3 2 5 3 1
EV = 1+ ×− =− =
× 3 12 48 18
There is some truth to this, but it’s probably not a curse. Athletes are
featured on the cover when they are having better than average performances,
and it’s no surprise that a better than average series is followed by a below
average series. That is, for any series that has variation, some parts of the
series will be above the average and others below the average. The above
average parts will be followed by below average parts to bring the whole back
to the average. This is called regression to the mean.
This makes it difficult to predict future performance when we just have one
encounter with a person. Imagine that you are interviewing two candidates for
a position in your company. One candidate has an exceptional performance
and the other has a lackluster performance. Who do you hire? Could it be
the case that the first is having an above average day and the second a below
average day? It would be natural to hire the first, but it would be also natural
to expect some regression to the mean.
Regression to the mean also makes it difficult to assess the effectiveness
of policies. If a city were to have a period with higher than average rates
of crime, it would be natural for citizens to demand that the mayor take
action. Unsurprisingly, after initiating curfews, hiring more police officers,
and instituting neighborhood watch programs, the crime rate goes down. Did
it go down because of the policies, or was it simply regression to the mean?
It’s difficult to say.
122 CHAPTER 13. APPLYING PROBABILITIES
Chapter 14
Inductive Arguments
123
124 CHAPTER 14. INDUCTIVE ARGUMENTS
the sample. I then conclude that the answer for the population is about what
it is for the sample.
There are some terms that are important to know when dealing with data
values. The mean is the mathematical average. To find the mean, add up all
the values of the data points and divide by the number of data points. For
example, the mean of 1, 2, 3, 5, 9 is 4. The median is the value that is in the
center, such that half of the numbers are less than it and have are greater.
In this case, the median is 3. The mode is the value that occurs most often.
The mode of 1, 2, 4, 2, 7, 2 is 2.
Another thing that is important to keep in mind is how spread out the values
are. The average annual temperature in Oklahoma City is about the same as
the average annual temperature in San Diego, leading one to conclude that
the two cities have about the same comfort level. The difference is that the
average monthly highs and lows range from 45 to 76 in San Diego and 29 to
94 in Oklahoma City. Three ways to talk about data dispersal are
• Range: the distance between the greatest and the smallest value,
• Percentile rank: the percentage of values that fall below some value,
and
• Standard deviation: how closely things are grouped the mean.
one such that every member of the population had an equal chance of being
included in the sample. Randomness is very difficult to achieve in practice.
For example, if I send out an email invitation to participate in the university
survey, it looks like every student has an equal chance of being included in
the sample. Actually, though, there are several groups that are guaranteed to
not be included: students who have forgotten their email password, students
who don’t check email, students who don’t really care, etc. Even if I have a
truly random sample, it is still possible for it to be a biased sample. This is
called random sampling error. Random samples, though, are less likely to be
biased than non-random samples.
Remember when I said that how large a sample needs to be depended on what
we wanted to know and the result we got from the sample? Now, that should
make more sense. Let’s say you were conducting a survey to determine which
of two candidates were going to win an upcoming election. You somehow
managed to get a random sample of 100, 70% of whom were going to vote for
candidate A. So, you conclude that between 60% and 80% of the population
were going to vote for candidate A. Since your range does not overlap the
50% mark, you rightfully conclude that candidate A will win. Now, had 55%
of your sample intended to vote for candidate A, you could only infer that
between 45% and 65% of the population intended to vote for that candidate.
To conclude something definite, you will need to shrink the margin of error,
which means that you’ll need to increase your sample size.
2.4 million people returned the survey and the magazine predicted that
Landon would get 57% of the vote to Roosevelt’s 43%.
The election was a landslide victory for Roosevelt. He got 62% of the vote
Landon’s 38%. What went wrong?
The problem wasn’t the size of the sample, although only 24% of the surveys
were returned, 2.4 million is certainly large enough for an accurate result.
There were two problems. The first was that 1936 was the end of the Great
Depression. Telephones, magazine subscriptions, and club memberships, were
all luxuries. So, the list that the magazine generated was biased to upper and
middle-class voters.
The second problem was that the survey was self-selected. In a self-selected
survey, it is the respondents who decide if they will be included in the sample.
Only those who care enough to respond are included. Local news stations
often do self-selected surveys. They will ask a question during the broadcast,
then have two numbers to dial, one for “Yes” and another for “No.” There’s
never a number for “Don’t really care,” because those people wouldn’t bother
calling in anyway. The 1936 survey failed to include people who didn’t care
enough to respond to the survey, but they very well might have cared enough
to vote.
said that other countries should let in our reporters, then there’s no fair
reason for me not to allow their reporters into my country.
To summarize, here is a list of bad polls:
• Self-selected
• Ignore order effects
• slanted questions
• push polls
• loaded questions
2. There are relevant dissimilarities. (If all the members of the sample
had excellent maintenance records, but our target had very poor main-
tenance, then we wouldn’t expect the target to be reliable just because
the members of the sample were.)
3. There are instances of the sample that do not have the property in
question. (The more 2013 Honda Civics we find that are unreliable, the
weaker the argument becomes.)
So, the arguments are stronger when there are
1. More relevant similarities,
2. Fewer relevant dissimilarities, and
3. Fewer known instances of things that have the shared properties but
lack the property in question.
Much of our reasoning is about causes and effects. We argue about proposed
solutions to social problems, but how can we evaluate a solution if we haven’t
identified the cause? Reasoning about causation is difficult but important, if
we’re wrong about causes, then we won’t be able to bring about our desired
effects. So, it’s important to be able to accurately detect causes and to avoid
the common mistakes in causal reasoning.
15.1 Correlations
An important 18th century philosopher, David Hume, pointed out that we
don’t directly observe the necessary causal link between two events. What
we observe is that the two events are correlated, then we infer that they are
causally related. The stronger the correlation, the greater the evidence that
there is some causal link.1
Correlation is a measure of the degree to which two variables are related.
A variable is something which can have different values, like age, GPA, or
nationality. Some variables, called dichotomous variables, only have two
values, pass/fail, enrolled, not enrolled, etc. If the variables are positively
correlated, then higher values of one tend to go with higher values of the other,
and lower values of one tend to go with lower values of the other. Examples
1
We’ll see later that, even with very strong correlation, it can be very difficult to say
exactly what the causal relation is.
133
134 CHAPTER 15. REASONING ABOUT CAUSATION
the crowing precedes the rising. I have heard about people who wear the
same shirt to every game that their favorite team plays. They wore it once
and their team one, therefore their wearing the shirt some caused the team
to win. Many superstitions and stereotypes are rooted in post hoc fallacies.
Everyone is ill, what’s the cause? The oysters are the only thing that they all
ate, so that’s the most likely culprit.
This is called the Method of Agreement. It’s used to detect the cause when
there are multiple cases of the effect.
The brother did not get ill, but everyone else did. So, the cause must be
something the rest ate, but he did not. The only thing is the salad, so that
must be it.
The Joint Method is simply applying both the Method of Agreement and
the Method of Difference in a case. Note here that the brother is not ill, but
everyone else is. Applying the Method of Difference, we decide that it is
either the beef or the salad. Now, we apply the method of agreement, and
see that, of those two things, the beef is the only one that everyone who got
ill ate. So, the cause is the beef.
Here, everyone is ill, and everyone had an identical meal. So, neither the
method of difference nor the method of agreement will help identify the cause.
They are not, however, ill to the same extent. The brother and the sister feel
a bit queasy, the mom is fairly ill, but the dad is critically ill. Everyone had
identical portion sizes of everything except the oysters. The brother and the
sister ate one oyster, the mom had four, and the dad ate a dozen. The degree
to which they ate the oysters matches the degree to which they are ill.
This is called the method of concomitant variation. If a quantitative change
in the effect is correlated with quantitative changes in some given factor, then
that factor should be cause.
16.1 Heuristics
Ideally, when we are pressed to make a decision about what to do or believe,
we would be able to gather and assess the evidence required to make a good
decision. Sometimes, though, we’re just not in a position to do that. We are
finite creatures with limited attention spans, limited computational abilities,
and even limited interest. Besides that, we very often do not have the time
or energy necessary to gather evidence. So, when we are pressed for quick
decision, we just have to work with what is available. What we use in those
cases are reasoning shortcuts, called inferential heuristics. They are quick,
and often get us close enough to the truth. Given our cognitive limitations,
quick and close is sometimes better than slow and precise.
We use these inferential heuristics often, and we’re usually not away of them.
They allow us to draw very quick inferences without having to gather evidence
or compute probabilities, and they work nearly automatically. it’s important,
though, to understand them, because there are certain situations in which
they tend to fail us in systematic ways. Here are some examples:
1. Do more people in the United States die from murder or suicide?
2. Are there more six letter words in English that end in ‘ing’ or that have
‘n’ as their fifth letter?
The answer to the first question is that there are nearly twice as many suicides
141
142 CHAPTER 16. HEURISTICS AND COGNITIVE BIASES
as there are murders. There have to be more six letter words that have ‘n’
as their fifth letter. If you got these wrong, it was likely from using the
availability heuristic.
When the data is available because it really occurs more frequently, then
the heuristic works find. The problem, though, is that there are many other
reasons for availability. Something might be more available because it’s
reported more frequently in the media, not because it actually occurs more
frequently. This is the case with suicides and murders. All murders are
reported, but few suicides are reported. This leads us to mistakenly believe
that there are more murders than suicides.
This also makes us underestimate some things and overestimate others, which,
in turn, causes us to make bad decisions concerning risks. Every terrorist
attack is reported, but few deaths by heart attack or stroke are reported.
Shark attacks are reported nationwide, but deaths caused by other animals
are not. Cases of winning the lottery are always reported, but no one mentions
the number of people who lost. We are led to believe, then, that winning the
lottery is not the near statistical impossibility that it is.
The easier it is to recall things, the more likely we tend to think they are.
How many six letter English words ending in ‘ing’ can you recall? (Flying,
skiing, typing, boring,. . . ) Are there more famous people from Oklahoma or
from Kansas? What can you easily recall? A person from Oklahoma is likely
to answer that differently than a person from Kansas.
16.1. HEURISTICS 143
affect heuristic might be a gambler playing against the odds because he feels
lucky, or posting something you regret on social media because you are angry.
Of course, it’s not always wrong to base decisions on our emotions. It may
even be better at times to base those decisions on emotions rather than a
calculation of the costs and payoffs. What is a better reason to buy flowers
for my wife, a cost-benefit analysis, or because I love her? There are other
times, though, when our emotions keep us from making good decisions, that’s
when we need to be careful.
This is related to the Pygmalion effect, the tendency for people to live up, or
down, to our expectations.
Why do people who know better do foolish things? Why do good people do
things that seem callous, or even immoral? One answer is that they don’t
really know better, or that they really aren’t as moral as they once seemed.
Another answer is that maybe they wouldn’t have done those things had they
not been in their respective situations. We’ll see experiments that show that
situations can somehow lead people to do things they would never otherwise
do.
17.2 Experiments
Here are a few of the experiments that show the various ways that situations
affect behavior
149
150 CHAPTER 17. THE EFFECTS OF THE SITUATION
were going to talk about the Good Samaritan were very likely to not help.
The researchers reported that some students on their way to talk about the
Good Samaritan literally had to step over the victim to hurry on their way.
Notice that the larger the group, not only were the subjects less likely to
report at all, but they were slower to report when they did. Every subject in
the two-person groups eventually reported, some after the victim finished his
message.
There are reasons that would explain this behavior. First, since we can’t see
or hear wha the other people are doing (or, more importantly, _not_doing),
we tend to assume that someone else has already intervened. The second
reason is something called diffusion of responsibility. If there is one person
besides the victim present, then that person feels 100% of the responsibility
for acting. If there are 10 people present, then the responsibility is diffused
throughout the group, an each person feels only 10% of the responsibility.
Feeling 10% percent of of the responsibility might very well not be enough to
motivate the person to act.
The experiment was planned for two weeks, but ended after six days for two
reasons. First, the guards began escalating their abuse in the middle of the
night when they thought no experimenters were watching, Second, a person
brought in from outside to interview the guards and prisoners was outraged
at what she saw. Given her response, it became clear that they needed to
end the experiment2 .
Sherif’s results were provocative, but they did have a problem, as Solomon
Asch later pointed. Since the point of light is actually stationary, there isn’t
a correct answer to how far it is moving. If there is not correct answer, then
how is it possible to be sure that the subjects are conforming? So, Asch
devised an experiment in which it would be clear if subjects were conforming.
2
For more details see ?
154 CHAPTER 17. THE EFFECTS OF THE SITUATION
Each person was to state aloud which line (A, B, or C) was closest in
size to the target line — the answer was intended to be obvious. The
test subject always sat at the end of the row and would answer last. The
confederates would give a clearly incorrect answer, and about 75% of the test
subjects conformed to that wrong opinion at least once. The times that the
confederates gave the right answer, less than 1% of the subjects gave the
wrong answer. Later, when asked why they gave the wrong answer, most
subjects said that they didn’t believe the answer was correct, but went along
with the group to avoid being ridiculed. (?)
It is important to note that Asch discovered that if there was only one
confederate then the test subject would not conform. Disagreeing with one
person seems to be no problem, but disagreeing with an otherwise unanimous
17.2. EXPERIMENTS 155
group is different. More important, even in the larger group, if even one of
the confederates refused to conform to the others, then the test subject would
also not conform.
Group Reasoning
157
158 CHAPTER 18. GROUP REASONING
That this occurs should surprise no one. We have all heard stories about
people who have done things in mobs that they never would have considered if
acting alone. For both types of shifts, being in a group magnifies the qualities
of the individuals.
There have been a number of proposed explanations for the risky shift:
Group polarization has also been shown to affect our attitudes. Students
that had low levels of racial prejudice became even less prejudiced after
discussing issues of race with each other. The reverse happened with more
highly prejudiced students. The became even more prejudiced after discussing
the same issues with each other. (?)
18.5 Groupthink
Groupthink is the tendency for groups to make poor decisions and judgments.
This is common in groups that are highly cohesive, have dynamic leaders, and
are isolated from any external input or information. Several of the studies
discussed in the last chapter are relevant here, such as the Asch conformity
study, the Milgram experiment, and the Stanford prison experiment. (Re-
member that the Stanford study was only stopped after it was viewed by an
external evaluator.) Members of such groups have a strong tendency to want
to please the group leader, to agree on any decision that is made, and to feel
both a strong sense of invulnerability and a strong sense of being right.
In many cases, though, groups are tasked to work on problems for which
there are no clear right answers. For example, a university committee might
be tasked with develop a strategy for increasing enrollment, or revise the core
curriculum. Groups working on problems like these can work well, but often
do not. The reason is that the group decision process naturally tends to go
like this:
1. Once the problem or task has been identified, a group member proposes
a solution.
2. Objections are then raised to the proposed solution.
3. Another solution is proposed, and new objections are raised. This may
be repeated several times.
4. Finally, a solution is proposed against which no strong objections are
raised.
5. Since no one can think of a serious objection, the proposal is accepted.
There are two problems with this process. The first is that the process is
biased in favor of ideas that are discussed early. The second problem is that
the solution that is accepted is the first minimally acceptable solution. There
may very well be better solutions that never had a chance of being considered.
Another reason is that, although group work does not seem to enhance abilities
to learn material in a basic sense, discussing and explaining the material does
enhance the understanding of the material.
By understanding when groups reason badly, we can now identify some
characteristics of successful groups. Successful groups
1. Protect the brain-storm process. That is, they do not evaluate the ideas
until all of the ideas have been proposed. If this isn’t feasible, then
another option is to initially split into sub-groups for the initial group
reasoning process.
2. Set specific goals. A group cannot identify the best solution if the
problem has not been made clear.
3. Get feedback, especially from outside the group.
4. Encourage dissent. If no one disagrees, then appoint someone to raise
objections to the group’s decision (known as the devil’s advocate).
5. Reward success, to motivate finding the best solution.
18.7 Voting
The final step in any group decision-making process is to determine the will of
the group, usually done by voting. If there are only two options, then voting
presents no problems — if there is a winner, then it will be absolutely clear
which option it is. If there are more than two options, however, things get
complicated.
Sometimes the group’s preferences are simply inconsistent. Let’s imagine a
small group with three people, who are considering three different options, A,
B, and C. The three people rank their preferences like this:
1. A>B>C
2. B>C>A
3. C>A>B
Both persons 1 and 3 prefer A to B, so A should win over B. Persons 1 and 2
both prefer B to C, so B should win over C. A consistent preference structure
should be transitive, so if A beats B, and B beats C, then A should also beat
C. In this case, however, persons 2 and 3 both prefer C to A, so the ranked
order looks like this: A>B>C>A, which means that A should be preferred
162 CHAPTER 18. GROUP REASONING
over A!
Let’s look at a fairly simple group of nine people considering three options.
Imagine that the people order their preferences like this:
2 3 4
A B C
B A A
C C B
with the fewest first-place votes is eliminated. We then look at the rankings
that have the eliminated option first, and give those votes to whatever option
those people ranked second. That sounds complicated but it should be easy
to understand with the example. Look at the scenario again:
2 3 4
A B C
B A A
C C B
6 5 4 2
A C B B
B A C A
C B A C
A and B each have 6 of the 17 votes, but a majority requires 9. So, there’s a
runoff between those two candidates, and, if nothing were to happen, then
C’s voters would switch to A and A would win.
Now, imagine instead that there is a debate just before the election, and A
has a particularly impressive performance. The two voters in the rightmost
column decide to switch their votes from B to A.
6 5 4 2
A C B A
B A C B
C B A C
Now, A has 8 votes, B only 4, and C has 5. So, the runoff now is between A
and C. The four voters in the third column that supported B give their votes
to C, and C wins with 9 votes compared to the 8 votes for A. Curiously, A
would have won had A not gained the extra support before the election!
Arrow proved that no method meets all of these conditions. (?) So, since
there is no perfect method, which method should be used? It really depends
on the circumstances. Some things that will need to be considered include
the cost and complexity of the voting system and the type and extent of
information that needs to be gathered. The more complex the system, the
less likely voters will feel they can trust the system. A system that is too
expensive is useless no matter how accurate it is.
166 CHAPTER 18. GROUP REASONING
Chapter 19
Social Dilemmas
167
168 CHAPTER 19. SOCIAL DILEMMAS
1. Each person wants the outcome that is best for that person.
2. Each person will act intentionally to achieve that outcome.
Most board games are what are called zero-sum games. In a zero-sum game,
if there is a winner, there must be a loser. Tic-tac-toe is the classic example.
If we give +1 point to the winner, -1 to the loser, and 0 to each for a tie,
then the sum of each players score for a game will always be 0. Our personal
interactions in life, however, are not always zero-sum. In a non-zero-sum
game, both players can win. Sometimes, what is best for me can always be
best for you.
In the cases that we will look at, all simple social dilemmas involving two
persons, each player will have two choices, to cooperate or to defect. We can
think of cooperating as keeping an agreement, or doing what is best for the
other person. Defecting is breaking an agreement, or doing what is best for
you at the expense of the other person. Each person decides to cooperate
with, or defect against, the other, without knowing what the other person
will do. There are, then, four possible outcomes:
The type of social dilemma is determined by how the persons involved rank
these four preferences. Before we look at some examples, I should define two
important concepts.
Stability: An outcome is stable when no party would have been better off by
acting in a different way, given what the other person did. This means that I
wouldn’t have any regrets acting the way I did, considering how you acted.
19.1. DEADLOCK 169
19.1 Deadlock
In a deadlock, the parties have this preference structure:
1. DC
2. DD
3. CC
4. CD
Each person’s first preference is that they defect and the other person cooper-
ate, followed by mutual defection, then mutual cooperation, and finally that
they cooperate and the other person defect. Notice that, strictly speaking,
this is not a dilemma. Each player prefers defection to cooperation, so there
is no question about what will happen.
Negotiations often take the form of deadlocks. Cooperation means that the
party will have to give something up in the negotiation. Of course, the first
preference is that they not have to give anything up, while the other party
does. Given the endowment effect, what a party gives up seems greater
in value than what they gain in return. So, neither party is inclined to
see cooperation as a benefit. Thus, the final outcome is mutual defection.
Negotiations break down, and the result is maintaining the status quo.
19.2 Chicken
This dilemma gets its name from a foolish game in which two people drive at
high rates of speed directly toward each other. The goal is to force the other
person to swerve, showing your bravery (or foolishness), and their cowardice.
In this case, cooperation is swerving, and defection is maintaining the direct
course. Here are the preferences:
1. DC
2. CC
3. CD
4. DD
The first preference is to seem brave, while the other person is a coward.
The second preference is to both be cowards, and never mention that this
happened. The third preference is to be the coward and still alive. The last
170 CHAPTER 19. SOCIAL DILEMMAS
preference is that you are both remembered as brave, and kind words are
etched on your tombstone.
So, what should you do, swerve or drive straight? (Obviously, the answer
is that you shouldn’t play foolish games like this, but we’ll ignore that for
now.) It depends on what you think your opponent will do. If you have good
reason to think your opponent is suicidal, then you definitely should swerve.
Otherwise, it’s hard to say.
Chicken dilemmas don’t just involve foolish games that can end in death.
Many volunteer situations are examples of chicken dilemmas. Imagine that
you are a parent who is asked to help provide refreshments for an elementary
school party. You’re very busy now, so you would prefer that someone else
do it. If that can’t happen, then your next preference is that you provide
some, but not have to provide all of the refreshments. You do want the kids
to be able to have the party, though, so your third preference is that you do
everything. This is better than no one doing anything, because then there
would be no party.
T Q
T 7,7 0,10
Q 10,0 3,3
Assuming that each person wants only what is best for that person, then
what should they do? An understandable first inclination is to say that they
should both stay quiet. That’s the only way they can both get 3 years, which
is really the best practical outcome. On the other hand, if Fred is going to
stay quiet, then shouldn’t Ethel confess? Then her sentence would drop from
172 CHAPTER 19. SOCIAL DILEMMAS
3 to 0 years. Also, if Fred decides to talk, then Ethel certainly should confess.
Her sentence would drop from 10 to 7 years. Basically, each person is three
years better off by confessing, regardless what the other does. But if it’s
rational for Ethel to confess, then it’s rational for Fred to also. So, it seems
that they’re both doomed to 3 years apiece.
They both would have been better off had they just cooperated with each
other by staying quiet. What makes the prisoner’s dilemma particularly
interesting is that, by acting rationally in terms of utility maximization, both
parties are worse off than they would have otherwise been. Acting for their
own individual good was, in fact, self-defeating.
Prisoner’s dilemma situations happen whenever a person can be better off by
defecting, providing that everyone else cooperates, but, if everyone defects,
then everyone is made worse off compared to mutual cooperation. So, if
everyone is cooperating, then each person has a strong motivation to defect,
which results in everyone defecting, which is worse for everyone.
more advertising is good for a company, but only if its competitors don’t
increase their advertising. But, what is good for one, should be good for
everybody, so everyone increases their ad sales, expenses rise, and profits
drop.
The same thing happens with salary caps in sports. An agreement to cap
salaries is good for the owners, but if everyone else keeps the agreement, it’s
good for one owner to exceed the cap to attract the best players. If one
breaks the agreement, though, the others will have to also, so the owners find
themselves in the same situation as they were in before, except for spending
a lot more money.
The use of performance-enhancing drugs, or doping, is another case in sports.
If only one athlete is doping, then that athlete has a competitive advantage
over others. So, to compete, the others also have to use the performance-
enhancing drugs. In the end, no one has an advantage, and everyone suffers
from the detrimental effects of using the drugs.
C D
C 2,2 0,3
D 3,0 1,1
174 CHAPTER 19. SOCIAL DILEMMAS
The first number in a pair is the points given to the row player, and the
second number is the points given to the column player. So, if a person
cooperates and the other defects, the defector is given 3 points and the other
Son gets nothing. Mutual cooperation is awarded 2 points apiece, and mutual
defection 1 point apiece. So, how should you play? If you’re only going to
play one round, the answer is clear: you should defect. Let’s assume that
your opponent will cooperate. In that case, you are one point better off
by defecting. If your opponent defects, you’re also one point better off by
defecting. So, you’re one point better off by defecting, no matter what your
opponent does. The rational strategy is for both players to defect.
What if you’re going to play more than one round? Should you cooperate
or defect? If you adopted a strategy of defecting every turn, you and your
opponent will end up getting one point per turn, which is only half what
you would get if you both cooperated. On the other hand, if you cooperated
every turn, you would be in trouble as soon as your opponent realized what
your strategy was. Somehow, you need a way of encouraging your opponent
to cooperate. The best strategy for a game with an unknown number of
turns, called an iterated prisoner’s dilemma with an unknown number of
iterations, is one called tit-for-tat. You cooperate on the first turn, then, on
every successive turn, do what your opponent did on the previous turn. So,
you reward your opponent for cooperating, and punish your opponent for
defecting. If both players are rational, then this strategy results in mutual
cooperation in the long run. The opponent realizes that it’s impossible to get
ahead by defecting, because the other person just gets even. What if your
opponent is irrational, that is, someone who doesn’t try to maximize their
points? This can happen in a number of ways—your opponent may just want
to “stick it to you” on every turn, or maybe he flips a coin to decide what to
do. In these cases, players just has to protect themselves by defecting every
turn.
If you’re playing a iterated game with a known number of iterations, then
things get surprising. Let’s say two people are playing a game with only five
rounds. To determine what they should do let’s work backwards from the
end of the game. The fifth round is essentially just like playing a single round
game. Each player is one point better off by defecting no matter what the
other person does, and there is no way for the other person to get even. So,
both players will defect on the fifth round:
19.5. PUBLIC GOODS 175
1 2 3 4 5
Player A D
Player B D
1 2 3 4 5
Player A D D
Player B D D
But what is true of round 4 is also true of rounds 1–3, so we should defect on
all turns:
1 2 3 4 5
Player A D D D D D
Player B D D D D D