This page contains the list of known errors in the book Logic (Greg Restall, published by Routledge, 2006).
Like any text, errors creep in at various stages of the process, and these can detract when reading it. So, this page contains the list of known errors in the text. Page references are from the first edition, from 2006 (the only so far).
Introduction
Chapter 1: Propositions and arguments
- Page 11, eight lines from the bottom. “in order to to give” should be “in order to give”.
- Page 18, Exercise {1.3}, part 1. “Critical Thinking” should be “PHIL137”.
Chapter 2: Connectives and argument forms
- Page 29: Paragraph two, sentence one should read “The first, p~, is not a formula, since a negation always attaches to a formula on its right” - not “on its left”.
- Page 34: Exercise {2.6}, part 5: Need a space between the “ ⊃ “ and the “c”.
- Page 34: Exercise {2.6}, part 14: This should be “(y ⊃ c) ⊃ p” and not “y ⊃ (c ⊃ p)” (which is a repeat of part 4).
Chapter 3: Truth tables
- Page 50: Exercise 3.2: the last formula has an extra closing bracket on the end. Delete it.
- Page 51: Exercise (3.4), part 15: There is a missing atomic proposition q. This part should read p, q therefore q ⊃ q.
Chapter 4: Trees
- Page 62: The rule for “Negated Disjunction” is misprinted. The A and B should both be negated. The rule should read: from ~(A ∨ B) to derive ~ A and ~ B.
- Page 62: The rule for “Negated Conditional” is misprinted. The B should be negated, not the A. The rule should read: from ~(A ⊃ B) to infer A and ~ B.
- Page 67: There’s a mistake in the tree in Box 4.2. In the fourth branch (ending in r ⊃ p and a closure), the “~ q” immediately in before the “r ⊃ p” should just be “q”.
- Page 68: There are three mistakes in the tree in Box 4.3. First, the leftmost branch should be closed. Second, at the end of the second branch from the left, “~q” should be “q”. Third, at the end of the third branch from the left, “q” should be “~q”.
- Page 69: paragraph before “Proof of fact 1”. All of the capital ‘X’s should be in italics.
Chapter 5: Vagueness and bivalence
Chapter 6: Conditionality
- Page 89: First paragraph: “…from John Howard is Prime Minister of Australia to if John Howard is loses the election, John Howard is Prime Minister of Australia.” should probably be something like “if John Howard loses the election,...”.
Chapter 7: Natural deduction
- Pages 103-4: The description of ∨-elimination on p. 104 doesn’t match the sequent formulation on p. 103. To match Y,B ⊢ C should be X,B ⊢ C. In the description on p. 104 the phrase “… provided you’ve got both X too)” is more than a little odd. It might make better sense to have X,A ⊢ C, Y,B ⊢ C and Z ⊢ A vv B above the line and X,Y Z ⊢ C below the line on p. 103, then make appropriate changes in the first paragraph on p. 104, including changing “… provided you’ve got both X too)” to “… provided you’ve got both X and Y too)”. (The thought behind the restriction on axiom sequents mooted on p. 109 would suggest this form.)
- Page 109: Second paragraph: All GBP symbols (£) ought to be turnstiles: ⊢ .
? Page 109, second paragraph. “Then there is no way to deduce A ⊢ B → A since the B was not used in the deduction of A.” What’s wrong with this deduction (in the style of Lemmon’s Beginning Logic in which the Rule of Assumptions is, in effect, the axiom A ⊢ A)?
1 A ⊢ A Axiom 2 B ⊢ B Axiom 3 A,B ⊢ A & B &-I 4 A,B ⊢ A &-E 5 A ⊢ B → A ->-I
BTW, why are the deductions in this chapter given using A, B, C, D rather than p, q, r, s?
Chapter 8: Predicates, names and quantifiers
- Page 115: “…is a multiple of ten…” should be “…is a multiple of ten”.
- Page 116: 6 lines from the bottom: “p is the predicate ‘is a philosopher’” should be “P is the predicate ‘is a philosopher’”.
- Page 119: Third example formula should be (∃x)(Px & (∃y)(Ly & Kxy)).
? Page 120: Add clause: any atomic formula is a formula. Cf. p. 28. Without it a lot hangs on the italicization of formula in atomic formula.
? Page 120: The Latinate ‘arity’ naturally goes along with unary, binary, ternary, …. With the Greek monadic, dyadic, triadic, … shoudln’t it be ‘adicity’?
- Page 123: Second para. “Table 8.1 gives are some more examples…” should be “Table 8.1 gives some more examples …”
- Page 124: Ex. 8.2 17 should be (∀x)(Px ⊃ (∀y)Lxy ⊃ ~ Lyx)
Chapter 9: Models for predicate logic
- Page 129: Square brackets in [Descartes, Kant] should be curly brackets: {Descartes, Kant}.
- Page 143, Box 9.2 The second formula in the tree should be “∃ x ~Gx”, not “∀ x ~Gx”.
- Page 145, Summary, point 5. “∀ x” should be “∃ x”
- Page 146, Ex. 9.1 “(∀ x)( Rxa ⊃ (∃ y)(Py & Rxy))” between the specification of the model and “evaluate the following formulas:” should be deleted.
- Page 146, Ex. 9.1 question 1 should be “(∀ x)(Tax ⊃ Gx)”, not “(∀ x)(Tx ⊃ Gx)”, where I(a)=a.
Chapter 10: Trees for predicate logic
- Page 165, Ex 10.1 (4) The solutions on this site report that the main connective of exercise 10.1 (4) is a biconditional. In the book it is a material conditional.
- Page 165, Ex 10.1 (5) The question should be (∀ x)(Fx ⊃ Gx) ⊃ ((∀ x)Fx ⊃ (∀ x)Gx), not (∀ x)Fx(Fx ⊃ Gx) ⊃ ((∀ x)Fx ⊃ (∀ x)Gx)
Chapter 11: Identity and functions
- Page 176, bottom: the interpretation given is g(b,c) = c. It should be g(b,c) = a.
- Page 177, last tree: The formulas at the top of the tree should be centred on the formulas themselves (with the tags for names substituted in hanging off to the right, as with the other trees).
- Page 177, end: The displayed tree should end “tree continued on next page.”
- Page 181, Exercise {11.10} in 5 and 7 the variable y should be bound by a universal quantifier.
- Page 182, Exercise {11.10}, part 5. It should read “RA ⊢ (∀ x)(∀ y)(x + y = y + x)” and not “RA < …”
Chapter 12: Definite descriptions
- Page 187, the middle branch for the tree rule for “~I(Fa,Ga)” should be “~(∀ y)(Fy ⊃ y=a)” not “(∀ y)(Fy ⊃ y=a)”.
Chapter 13: Some things do not exist
- Page 199, under the heading “Universal” the rule should take “(∀ x)A” to “~ E!a” or “A(x:=a) (any a)”. Under the heading “Negated Universal” the rule should take “~(∀ x)A” to “E!a” and “~ A(x:=a) (a new)”.
- Page 201, Tree in Box 13.1: The branch ending “~E!a” should end in a closure.
- Page 203, Question 13.1.3 should be (∀ x)(Fx ⊃ E!x), ~ E!a, therefore ~ Fa.
Chapter 14: What is a predicate?
Chapter 15: What is logic?
.