Machine-translated by Google. Questions are authored in English.
Top

Discussion

Which one of the following well-formed formulae in predicate calculus is NOT valid?

  • A.(∀x p(x) ⇒ ∀x q(x)) ⇒ (∃x ¬p(x) ∨ ∀x q(x))
  • B.(∃x p(x) ∨ ∃x q(x)) ⇒ ∃x (p(x) ∨ q(x))
  • C.∃x (p(x) ∧ q(x)) ⇒ (∃x p(x) ∧ ∃x q(x))
  • D.∀x (p(x) ∨ q(x)) ⇒ (∀x p(x) ∨ ∀x q(x))

Answer: D

The formula that is NOT valid is ∀x (p(x) ∨ q(x)) ⇒ (∀x p(x) ∨ ∀x q(x)).

Counterexample: let the domain be the integers, \(p(x)\) = “x is even” and \(q(x)\) = “x is odd”. Every integer is even or odd, so the left side is true, but neither “all integers are even” nor “all are odd” is true.

The others are valid. (A): if \(\forall x\,p(x)\) fails then \(\exists x\neg p(x)\) holds, and if it holds then the premise gives \(\forall x\,q(x)\). (B): an existential distributes over disjunction, so the two sides are equivalent. (C): a witness of \(p \land q\) is a witness for each separately.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.