Errata in The Logic Book

6th Edition
PREFATORY NOTE:
We use the following abbreviations in this document:
ln
lns
der
par
CHAPTER 1
Page and
Location
11, 1.2E
EXERCISES
Note:

CHAPTER 2
Page and
Location
18 ln 17
27, ln 2 of 1st full
par
34, ln 31
46, 8 lns from
bottom
46. 4 lns from
bottom
50, 4 lns from
bottom
55, ln 4
CHAPTER 3
Page and
Location

line
lines
derivation
paragraph

Replace

With

the following web page: http://

highered.mcgraw-hill.com/
sites/007353563x/information
_center_view0/

the following web page:

www.mhhe.com/bergmann6e

Replace

With

of what expressions counts as a

sentence of SL
the connectives of SL

of what expressions count as

sentences of SL
the connectives of SL

Should Cynthia finish her current

on time
that folk music will prove to be a
fad].
P: Country and western music
proves to be a fad.
of the group, one of whom
G: The Red Sox have a

Should Cynthia finish her current

assignment on time
that country and western music will
prove to be a fad].
P: Country and western music will
prove to be a fad.
of the group, at least one of
whom
C: The Red Sox have a

Replace

With

Errata in The Logic Book 6th Edition

Page 2

73, ln 13
93, 1st ln after 2nd
truth-table
94, Exercise 2.b.
102, Instructions
for exercise 1.

A material biconditional has the

under its main connective.

A material conditional has the

under the arrow for that sentence.

{H (~ H H)}
1. Construct truth-tables and
state

104, Exercise
4.d., 3rd premise

If Sophie or Jason both believe

{H, H ( ~ H H)}
1. Construct full truth-tables for
the following arguments and
state
If Sophie and Jason both believe

Replace

With

CHAPTER 4
Page and
Location
112, Schema for
Material
Biconditional
117, ln 5 of 1st
full par
117,
Biconditional
Decomposition
Rule Name
117, Schema for
Negated
Biconditional
Decomposition
Rule Name
118, 1st ln of 1st
tree
121, 5 lns below
boxed text
128, 8 lns before
Exercise set 4.1E

Material Biconditional
P Q
sentences of the form P Q
may
Biconditional
Decomposition (~ D)
Negated Biconditional
Decomposition ( D)

Material Biconditional
PQ
sentences of the form ~ P Q
may
Biconditional
Decomposition ( D)
Negated Biconditional
Decomposition (~ D)

A (B D)

A (B C)

on which the m embers of

this
...in which every memberits
main connective.

on which the members of this

128, 2 lns before

Exercise set 4.1E

truth-table such thatits main

connective.

138, 1st ln after

tree

So we know that the set consisting

of the sentences we are testing is
truth-functionally consistent,...

in which there is a T below the

main connective of every compound
sentence and below every atomic
sentence.
truth table in which there is a T
below the main connective of every
compound sentence and below every
atomic sentence.
So we know that the set we are
testing is truth-functionally
consistent

Errata in The Logic Book 6th Edition

Page 3

CHAPTER 5
Page and
Location

Replace

With

155, f.

f.

*f.

156, 10 lns after

der

A C on line 6.

159

Derive

Negation Elimination (~ E)

Derive

A H on line 6.

Negation Elimination (~ E)

~P

~P

~Q

~Q

~P

161, ln 7 of
second der
171, 2nd der, lns
11-14 of 2nd der

174: f.
176,ln 5
194: 1st der, l. 6
213, Ex 10.e
215

A ~ B

A ~B

Scope lines

Extend outermost scope lines

through ln 14; extend 2nd scope lines
through ln 13; extend innermost
scope lines through ln 12.
Renumber lines 12-17 as 11-16
the theorem.

the theorem that is the last line

of that derivation.
1-_E
{~ [A (B C)],
Modus Tollens

1, _ E
{~ [(A B) C],
Modus Tollens

PQ

PQ

~P

~Q

Errata in The Logic Book 6th Edition

~P

217 lns 11-12

such moves within a derivation.

225, Glossary

Replace every occurrence of

SD
with

Page 4

~P

such replacements within a

sentence of SL.
SD/SD+

CHAPTER 7
Page and
Location

Replace

With

275:3.c.Section
7.5
282, l. 4 of 1st full
par
283, 5th bulleted
example
282, ln 3 of 1st
full par

(z) ~ (Cz ~ Cz)

(z) ~ (Cz ~ Cz)

(x) (~ Rxr ~ Rhr)

(x) (~ Rxr Rhr)

but intently as the rhinos

but intently, and the rhinos

a sentence of a form such as

(x)(Rxr Rhr) is equivalent to
(x)((~ Rxr ~ Rhr),

284, 3rd bulleted

example

Replace bulleted example with

a sentences of the forms (x)(P

Q) and (x)( ~ P R) are
equivalent. Hence (x)(Rxr Rhr)
is equivalent to (x)( ~ Rxr Rhr),

The grizzlies are discontent

when forced to dine without
wine.
Each w is such that if w is a
grizzly then w is discontent
when forced to dine without
wine.

286, last lns of 3

full par
296,
Symbolization

rd

And symbolize it as
and says nothing of non-jaguars. and says of each non-jaguar only
that if it is a jaguar (which it isnt),
then it prances upon tree branches.
Dxy: x is evenly divisible by y (x Dxy: x is evenly divisible by y (x is
is divisible by y without
divisible by y without

Errata in The Logic Book 6th Edition

Key

remainder)
a: 2
(x)[( y) Pxy Pxs]

305, l. 10
310, before start
of Section 7.5

Page 5
remainder)
a: 1
b: 2
(x)[(y) Pxy Pxs]

Exercises for Section 7.4

7.4E EXERCISES
1. Determine which of the following attempted symbolizations are appropriate. For those
that are not, explain why not.
UD:
Bx:
Gx:
Lx:
Mx:
Tx:
Vx:
Wx:
Cxy:
Rxy:
Sxy:
j:
s:

The set of all living creatures

x is at the Bronx zoo
x is a giant
x believes there are vampires
x is a moose
x is a tufted titmouse
x is a vampire
x wants to see a vampire
x wants to catch y
x wants to ride y
x wants to see y
Jeremy
Sue

a. Jeremy wants to catch a vampire.

(x)(Vx & Cjx)
*b. Sue wants to see a vampire.
Ws
c. Sue believes there are vampires but doesnt want to catch one.
Ls & ~ (y)(Vy & Csy)
*d. Sue wants to see a moose and Jeremy wants to ride one.
(x)(Mx & Ssx) & (x)(Mx & Rjx)
e. There is a moose at the Bronx zoo that Sue wants to see and Jeremy wants to ride.

Errata in The Logic Book 6th Edition

Page 6

(z)[(Mz & Bz) & (Ssz & Rjz)]

*f. There is a giant tufted titmouse at the Bronx Zoo.
(z)[(Tz & Gz) & Bz]
2. Using the symbolization key
UD: The set of all people
Sx: x is a sales clerk
Wxy: x is waiting for y
h: Helen
give a context in which it would be appropriate to symbolize Helen is waiting for a sales
clerk as (z)(Sz & Whz) and one where this symbolization is not appropriate.
3. Symbolize the following sentences in PL using the given symbolization key.
UD:
Cx:
Lx:
Rx:
Wx:
Yx:
Dxy:
Sxy:
d:
j:
r:
a.
*b.
c.
*d.
e.
*f.
g.
*h.
i.
*j.
k.
*l.

The set of all people

x is careless
x is lucky
x is a sailor
x is a Wilcox
x dies young
x is a daughter of y
x is a son of y
Daniel Wilcox
Jacob Wilcox
Rebecca Wilcox

Some sailors are both careless and lucky.

Some careless sailors arent lucky.
Not all lucky sailors are careless.
All careless sailors, except the lucky ones, die young.
Not all sons of sailors are sailors.
Not all daughters of sailors are sailors.
Not all sons and daughters of sailors are sailors.
Sailors who arent lucky and are careless have neither daughters nor sons.
Sailors who have either sons or daughters are lucky.
Sailors who have both daughters and sons are lucky.
Rebecca Wilcox is either a sailor or the daughter of a sailor.
Every Wilcox is either a sailor or the offspring of a sailor.

Errata in The Logic Book 6th Edition

Page 7

m. Either Rebecca Wilcox and all her children are sailors or Jacob Wilcox and all his
children are sailors.
4. Symbolize the following sentences in PL using the given symbolization key.
UD: The set of employees of Temple University
Ax: x is an administrator
Cx: x is a coach
Fx: x is a faculty member
Mx: x is an MD
Ox: x is a union officer
Px: x is paranoid
Rx: x should be fired
Ux: x is a union member
Dxy: x distrusts y
Exy: x earns more than y
p: the president
j: Jones
a. Every administrator earns more than some faculty member, and every faculty
member earns more than some administrator.
*b. If any administrator earns more than every faculty member, Jones does.
c. No faculty member earns more than the president.
*d. Any administrator who earns more than every faculty member should be fired.
e. No faculty member earns more than the president, but some coaches do.
*f. Not all faculty members are union members, but all union members are faculty
members.
g. No administrator is a union member, but some are faculty members.
*h. Every faculty member who is an administrator earns more than some faculty
members who are not administrators.
i. At least one administrator who is not a faculty member earns more than every
faculty member who is an administrator.
*j. Every faculty member who is an MD earns more than every faculty member who
is not an MD.
k. Some faculty members distrust every administrator, and some administrators
distrust every faculty member.
*l. There is an administrator who is a faculty member and distrusts all administrators
who are not faculty members.
m. Anyone who distrusts everyone is either paranoid or an administrator or a union
officer.
*n. Everyone distrusts someone, but only administrators who are not faculty members
distrust everyone.
5. Use the following symbolization key to translate sentences ar into fluent English.
(Note: All of the following claims are true.)

Errata in The Logic Book 6th Edition

UD:
Dx:
Nx:
Px:
Exy:
Lxy:
Oxy:
Rxy:
Sxy:
Txy:
a:
b:
c:
a.
*b.
c.
*d.
e.
*f.
g.
*h.
i.
*j.
k.
*l.
m.
*n.
o.
*p.
q.
*r.

Page 8

The set of positive integers

x is odd
x is even
x is prime
x plus y is even
x is larger than y
x times y is odd
x times y is prime
x plus y is odd
x times y is even
1
2
3
(x)[Nx (y)Txy]
(x)(y)[(Dx & Dy) Oxy]
(x)(y)[Exy [(Nx & Ny) (Dx & Dy)]]
(x)[(Px & (y)(Py & Lxy)) Dx]
(y)[Py & (x)(Px Lyx)]
(y)(z)([(Py & Pz) & (Lyb & Lzb)] Oyz)
(x)(y)[(Px & Py) & Rxy]
(x)(Px & Nx)
(x)[Px & (y)Txy]
(x)(y)Lxy & (x)(y)Lyx
(x)(y)[Oxy (Dx & Dy)]
(x)(y)[Txy (Nx Ny)]
(x)(y)[(Dx & Dy) (Oxy & Exy)]
(x)(y)(Lxy Lyx)
(x)(y)[(Dx & Ny) (Sxy & Txy)]
(x)(y)[[(Px & Py) & Lcx] Txy]
(y)[(Lya & Lcy) & (Py & Ny)]
(x)[(Px & Nx) & (y)((Py & Lyx) Dy)]

312, l. 13 from
UD: The set of items in a fruit
bottom
bowl
CHAPTER 8

UD: The set of items in a fruit

basket

Page and
Location

Replace

With

329, l.5

, and quantificational entailment

validity.
(where A is an

, and quantificational entailment

and validity.
(where A is an

334, l. 3 from

Errata in The Logic Book 6th Edition

bottom
348, l. 3 from
bottom

353, lns. 12-14

379, Ex. 1

379, Ex. 2

379, Ex. 7.
398, 7.e.

Page 9

an interpretation on which a
sentence is true is called a model
of that sentence,

an interpretation on which a
sentence of PL is true is called a
model of that sentence, and an
interpretation on which all the
members of a set of sentences of PL
are true is called a model of that
set,
That is, every member x must be
That is, every member x must be
such that if x is in the extension of such that there is some member y
F then there is some member y of such that if x is in the extension of
the UD that is in the extension of
F then y is in the extension of G.
G.
Produce a truth-functional
Produce a truth-functional
expansion of each of the
expansion of each of the
sentences in Exercise 7 in sentences in Exercise 6 in
Produce a truth-functional
Produce a truth-functional expansion
expansion of each of the sentences of each of the sentences in Exercise
in Exercise 8 in
7 in
Show that each of the sentences in Show that each of sentences a-h in
Exercise 2 in
Nobody has three parents.
Nobody has exactly three parents.
Everybody has more than one
Everybody has more than one
parent. Therefore everybody has
parent. Therefore everybody has
two parents.
exactly two parents.

CHAPTER 9
Page and
Location

Replace

With

409, ln 1
409, 2 lns before
9.1E
EXERCISES
409, footnote 2

Guideline 1 should
...it is a good policy to stick with
guideline1, but

Guideline 2 should
it is a good policy to stick with
guideline 2, but

such trees requires abandoning

guideline 1
As expected, the tree is open, so

such trees require abandoning

guideline 2
As expected, the tree has at least one
completed open branch, so
7 ~ D

418, 1st ln after

2nd tree
435, ln 8 of 2nd

6 ~ D

Errata in The Logic Book 6th Edition

tree
446, 1st ln of 2nd
full par
452, ln 4 of tree
452, last ln
457, 5.p.

Page 10

(x)(Fbx & ~ Fxa)

(x)(Fbx & ~ Fax)

3 ~ D
f:
(x) ~ Hx

3 ~ D
f:
(x)Hx

Page and
Location

Replace

With

475, 12 lns from

bottom
486, ln 5
493:25
494 2nd der ln 3
494, 3rd der ln 3
495, 1st der ln 3
497, 2nd der
498, 1st der
498, 2nd der
499, last lns
505, 2nd der, ln 3
512, 1st der, 1st
goal (G)
512, 1st der, 3rd
goal (G)
512, 1st der, last ln
513, 1st der, ln 3
513, 1st der, ln 7
514, 1st der, ln 8
517, 1st der,
penultimate lns
522, 2nd der, ln 3

Universal Elimination

From {~ (x)Fx:
Fb & Gb
A/ ~E
A/ ~E
A/ ~E
Derive: (x)(y)Fxy
Derive: (x)(y)Fxy
Derive: (x)(y)Fxy
from Lta we can
A/ ~I
15 I

From {~ (x)Fx}:
Fa & Ga
A/ ~I
A/ ~I
A/ ~I
Derive: (x)(w)Fxw
Derive: (x)(w)Fxw
Derive: (x)(w)Fxw
from Lta we can
A/ ~E
_ I

2-17 ~

2-_ ~ E

18 I
A I
A~
3, 4-7 E
2, 4-6 E

_ I
A / I
A/ ~E
2, 3-7 E
2, 4-_ E

A/ ~I

A/ ~E

CHAPTER 10