Scribd
Upload
81 views1 page

Teach Yourself Logic 2017

This document lists corrections to the book "Mathematical Logic" by Chiswell and Hodges. It provides over 20 corrections to exercises, definitions, theorems, and other parts of the text. The corrections cover a wide range of pages and include errors such as incorrect variable names, missing punctuation, and wrongly labeled definitions or proofs. The author and contact information are listed at the end.

Uploaded by

山田耕作
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views1 page

Teach Yourself Logic 2017

This document lists corrections to the book "Mathematical Logic" by Chiswell and Hodges. It provides over 20 corrections to exercises, definitions, theorems, and other parts of the text. The corrections cover a wide range of pages and include errors such as incorrect variable names, missing punctuation, and wrongly labeled definitions or proofs. The author and contact information are listed at the end.

Uploaded by

山田耕作
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Corrigenda for Mathematical Logic, Chiswell and

Hodges
• p.20: Ex. 2.4.1(c): b (not a) unequal to 0.
• p.22: last displayed item, top right: should be D, not D0 .
• p.23: Exercise 2.5.1(d) should read
` (((φ ←→ ψ) ←→ χ) −→ (φ −→ (ψ ←→ χ)))
It is not possible to do the exercise as given in the book using only the rules developed so far.
For if it were, one could give a proof that
` ((φ ←→ (ψ ←→ χ)) −→ ((φ ←→ ψ) −→ χ))
and so a proof that
{(φ ←→ (ψ ←→ χ)), (φ ←→ ψ)} ` χ
using just these rules. The method of Exercise 3.9.2 shows that this can’t be done, as follows.
Add to that exercise that the value of (p ∧ q) is the minimum of the values of p and of q, and
the value of (p ←→ q) is the same as that of ((p −→ q) ∧ (q −→ p)). Then show that the
conclusion of Exercise 3.9.2(c) remains true when the rules (∧I), (∧E), (←→I) and (←→E)
can also be used in D.
Therefore, it suffices to find values for φ , ψ, χ such that (φ ←→ ψ) and (φ ←→ (ψ ←→
χ)) both have value 1 but χ has value less than 1. The following values work: φ and ψ have
value 0, χ has value 1/2.
• p.44: exercise 3.2.6, should be “if D1 (µ) = (ν1 , . . . , νn ) then D2 ( f µ) = ( f ν1 , . . . , f νn ).”
• p.47: the penultimate sentence of Theorem 3.3.4 should read “Moreover in case (b) the for-
mulas φ and ψ are uniquely determined segments of χ”.
• p.62: in Definition 3.5.1, Line 3, “identity” should be “identify”.
• p.72: Definition 3.7.1 should read “to each qi (1 ≤ i ≤ k) . . .” .
• p.74: the last line should end “both A? (φ [S]) and A[S]? (φ ) are F.”
• p.75: Theorem 3.7.6(b) should be labelled “Replacement Theorem”.
• p.78: the expression (3.59) should be (· · · (φ1 ∧ φ2 ) ∧ · · · ) ∧ φn ).
• p.79: part (b) of Definition 3.8.1 should read “. . . these n formulas are called the disjuncts of
the disjunction.”
• p.84: at the end of exercise 3.8.2(a), it should be “ . . .logically equivalent to φ .]”.
• p.95: Exercise 3.10.1 should begin “If we kept the truth function symbols −→, ∨ and ←→”.
• p.119: Definition 5.3.9, part (a), the complexity of a formula is the height of the parsing tree
with leaves labelled by terms, and the corresponding edges, removed. This truncated parsing
tree should also be used in part (c).
• p.144: parts (1) and (2) of Theorem 5.8.3 are referred to as (a) and (b) in the proof.
• p.146: in Definition 5.8.4, it should be (k1 , . . . , kn ), not (k1 , . . . , km ).
• p.190: Definition 7.6.3, third line, RL(σ ) should be LR(σ ).
• p.193: in the last sentence of the proof of the Compactness Theorem, it should be Γ 0 |= ⊥,
not Γ |= ⊥.
• p. 202: proof of Theorem 7.8.3(a), third line, should be “Hence X is countable by Lemma
7.8.2.”

Author: Ian Chiswell


[email protected]
Last updated 8th July 2016

You might also like