Consider the following well-formed formula (WFF) of predicate logic: ∀x(P(x) →…
TPSC Computer/IT Posts · 2026 · Junior Forensic Digital Analyst · Part III
Consider the following well-formed formula (WFF) of predicate logic:
∀x(P(x) → Q(x)) → (∃xP(x) → ∃xQ(x))
Which of the following statements about this WFF is correct?
- A.
Valid only for finite domains
- B.
Valid only if P(x) → Q(x) holds for every x in the domain
- C.
Always valid
- D.
Equivalent to ∃x(¬Q(x) ∧ P(x))
Attempted by 35 students.
Sign up free to check your answer
Sign up freeLoading lesson…