Official Errata for Computability and Logic 5th ed. is here. https://www.princeton.edu/~jburgess/addenda.htm
These are extra errata I have found so far. I read Kindle edition as of Nov. 2017.
Greek letter gamma Γ is missing in several places.
Printed editions might not have these errata.
p.16
For each positive integer n,nΔ(L) if and only if n is not in Sn
should read
n ∈ Δ(L)
p.29 3-4 Example
Started on the leftmost blank of the left block
should read
leftmost stroke
p.69 6.9 Example
Define sg(0) = 0, and sg(0) = 1
should read
sg(x) = 1
p.105
denotation of is still the function that adds one
should read
denotation of ' is
p.108 Table 9-3. last formula should read
∀ x<3 ->
p.109 if F has M of each kind of parenthesis,
should read
F has m
p.121 10.5 Example (b)
then for any constant c not occurring in or Γ or ∃xB(x) is satisfiable.
should read
not occurring in Γ or ∃xB(x), Γ or B(c) is satisfiable.
Proof:
want to show that some interpretation makes and B(c) true,
should read
makes Γ and B(c) true
p.123 10.4 (b)
E is implied by.
should read
E is implied by Γ .
p.136 problem 11.9
read
∀x 0<x'
for
∀x ~0<x
p.148
Since the sentences in do not involve identity,
should read
sentences in Γ do
p.150 Problem 12.7
Show that P> and Q are isomorphic.
should read
P and Q
p.153 (S3)
either Γ∪{B} is in S or ∪ {C} is in S.
should read
or Γ∪{C}
p.154
or in other words that there is some finite subset of ∪ {B} that is not in S.
should read
Γ∪{B}
p.155
(C8) If B(s) and s = t are in *,
should read
in *Γ
p.157
If B1∨B2 is in *,
should read
in Γ*
p.157 Proof (E4)
in *, twice
p.169
if and only if some finite subset Γ0 Γ of secures
should read
subset Γ0 of Γ
p.174 Consider (R2a)
that makes all the sentences in true.
should read
in {~A}∪ Δ true
p.175 For (R5)
then the interpretation makes
should read
otherwise,
p.176
by the must also make A(s)
?
p.178 (S4)
read {~B} for {B}
p.185 problem 14.1 (b)
read every finite subset for some finite subset.
p.189 15-5 proof
read ∅ => Γ for Γ =>∅
p.190
it will simply be the set of n such that Rdn.
should read
such that Sd holds.
Note:
Rdn here has noting to do with Rsd in Corollary15.4. Rather, Rdn will be defied on p.190 using Sd in Corollary15.4.
p.191
read sentences proved by Γ we call
p.192
read f01 for ' or f02
p.194
former is equivalent to the existence of n and i such that a = 2^2 · 3^n · 5^i, and the latter is equivalent to the existence of i such that a = 2^2 · 3^n · 5^i .
should read
former is equivalent to the existence of i such that a = 2^2 · 3 · 5^i, and the latter is equivalent to the existence of n and i such that a = 2^2 · 3^n · 5^i .
the first condition amounts to ∃n < a ∃i < a(a = 2^2 · 3^n · 5^i ) and the second to ∃i < a(a = 2^2 · 3^n · 5^i ).
should read
the first condition amounts to ∃i < a(a = 2^2 · 3 · 5^i ) and the second to ∃n < a ∃i < a(a = 2^2 · 3^n · 5^i ).
p.212 example 16.17
read x' is the successor of x
p.221 17.2 Lemma Proof:
of Gödel numbers of sentences in T
should read
theorems
p.222
if and only if f (a) is in ∧,
?
p.227
by a formula ϕ(x) if ∀x(ϕ(x) ∀ x = n)
should read
ϕ(x) ∨ x = n
also in p.228
GB(x, 10) ∀ x = n)
p.232
and if 0!=1 is also provable from T, then T is inconsistent
should read
0=1
p.273
Note: s in R(u1, ..., us) is a number of free variables. So, s=0 means R is a sentence. That includes the case when R is S itself.
Great thanks to Prof. Deemter in University of Aberdeen for the slides "Monadic Predicate Logic is Decidable" - http://homepages.abdn.ac.uk/k.vdeemter/pages/teaching/CS3518/abdn.only/MonadicFOPL.pdf
p.304
read rational for natural numbers come first
p.307
read
M |= ∃z x = y · z[a, b].
for
going to write M |=∃=∃z x = y · z[a, b]'.
p.313 Proposition 25.9
read standard for nonstandard ω-model of analysis
p.316
read |M| for S2 of ∃M∃
p.236 18.4 Theorem
read
|- T B(⌜A⌝) → A, then |- T A
for
if T B( A ) → A, then T A.
Instructor's manual part A Errata
p.10 Chapter 7 Hint for Problem 7.3
read 7.6 for Corollary 7.8
Last update Jan. 2018 by kanda.motohiro@gmail.com