SOLUTIONS TO HOMEWORK 4

MATH 430, SPRING 2014

Problem 1. Section 2.1/ Exercise 1

Part (a): ∀x(N x → 0 < x)
Part (b): ∀x(N x → (Ix → I0))
Part (c): ∀x(N x → ¬(x < 0))
Part (d): ∀x(N x → (¬Ix → (∀y(N y → (y < x → Iy)) → Ix)))
Part (e): ∀x(N x → ¬∀y(N y → y < x))
Part (f ): ∀x(N x → ¬∀y(N y → ¬(y < x)))
Problem 2. Section 2.1/ Exercise 3
¬∀x(a ∈ x) ∧ ¬∀x(b ∈ x)
Problem 3. Section 2.1/ Exercise 5
Part (a): There are two possible interpretations and respective transla-
tions:
(1) “There is a person, which can be fooled at all times”
∃x(P x ∧ ∀y(T y → F xy)) iff ¬∀x(¬(P x ∧ ∀y(T y → F xy)) iff
¬∀x(P x → ¬∀y(T y → F xy))
(2) “At all times you can find someone to fool”
∀y(T y → ∃x(P x ∧ F xy)) iff ∀y(T y → ¬∀x(P x → ¬F xy))
Part (b): There are two possible interpretations and respective transla-
tions:
(1) “Every person can be fooled some time”
∀x(P x → ∃y(T y ∧ F xy)) iff ∀x(P x → ¬∀y(T y → ¬F xy))
(2) “At some point in time you can fool everyone simultaneously”
∃y(T y ∧ ∀x(P x → F xy)) iff ¬∀y(T y → ¬∀x(P x → F xy))
Part (c): ¬∀x(P x → ∀y(T y → F xy))
(Equivalently you can write: ¬∀y(T y → ∀x(P x → F xy)))
Problem 4. Section 2.2/ Exercise 2.
Show that no one of the following sentences is logically implied by the
other two.
(1) α =“∀x∀y∀z(P xy → P yz → P xz)”
(2) β =“∀x∀y(P xy → P yx → x = y)”
(3) γ =“∀x∃yP xy → ∃y∀xP xy”
For each of these sentences we have to give an example of a model in
which the sentence in question is false, but the other two are true.
1
2 SOLUTIONS TO HOMEWORK 4 MATH 430, SPRING 2014

(1) Let A = (N; P A ) where P A = {hm, ni | n + 1 = m}. Then α fails in

A since the relation x = y + 1 is not transitive. A |= β since for any
two natural numbers m, n we cannot have n = m + 1 and m = n + 1
to be both true, and so A |= (P xy → P yx → x = y)[m, n]. Also,
since 0 does not have a predecessor, we have that A |= ¬(∀x∃yP xy),
and so A |= γ.
(2) Let A = (N; P A ) where P A = {hm, ni | n, m are both even }. Then
β fails in A. On the other hand, A |= α and A |= γ. The last is
because A |= ¬(∀x∃yP xy).
(3) Let A = (N; P A ) where P A = {hm, ni | m ≤ n}. Then since every
natural number has a greater element, but there is no greatest num-
ber, we have A 6|= γ. On the other hand ≤ is both transitive and
antisymmetric, and so A |= α and A |= β.
Problem 5. Section 2.2/ Exercise 3
Show that {∀x(α → β), ∀xα} |= ∀xβ.
Suppose A is a model and s is a variable assignment such that A |=
{∀x(α → β), ∀xα}[s]. We have to show that A |= ∀xβ[s]. Let d be any
element in the universe of A. We have the following:
(1) A |= ∀x(α → β)[s]. So, we have that A |= (α → β)[s(x | d)]
(2) A |= ∀x(α)[s]. So, we have that A |= α[s(x | d)]
(3) Form (1) and (2) it follows that A |= β[s(x | d)].
We showed that for any d in the universe of A, A |= β[s(x | d)]. Therefore,
A |= ∀xβ[s] as desired.
Problem 6. Section 2.2/ Exercise 4
Suppose x is not free in α. Show that α |= ∀xα.
Suppose A is a model and s is a variable assignment such that A |= α[s].
We have to show that A |= ∀xα[s]. Let d be an element in the universe of
A. Since s and s(x | d) differ only on x, which is not free in α, we have that
those two assignments agree on all of the free variables of α. So, by theorem
22A and since A |= α[s], it follows that A |= α[s(x | d)].
We showed that for any d in the universe of A, A |= α[s(x | d)]. Therefore,
A |= ∀xα[s] as desired.