Homework 8

PHIL 150
due November 27, 2018

Which of the following are true of first-order logic? For each formula, provide a
justification in the form of either a brief argument, or a counter-model.

1. (∀xP(x) ∧ ∃xQ(x)) → ∃x(P(x) ∧ Q(x))

2. ∀x(P(x) ∨ Q(x)) ↔ (∀xP(x) ∨ ∀xQ(x))

3. ∀xP( f (x)) ∨ ∃x¬P(x)

4. {∀x∃y f (y) = x} ∀x∀y( f (x) = f (y) → x = y)

5. {∀xR(x, x), ∀x∀y∀z((R(x, y) ∧ R(y, z)) → R(x, z))} ∀x∀y(R(x, y) → R(y, x))

*6 Extra credit: Section 6.5 of the reader proves that the validity problem for
First-Order Logic is undecidable. Explain why, given this result, the entail-
ment problem and the satisfiability problem for First-Order Logic are also
undecidable.