Does ∧ still mean intersection when using predicate logic?
This is one of the questions asked in class.
Is the sentence valid? (∃xQ(x) ∧ ∃xR(x)) → ∃x(Q(x) ∧ R(x))
If it is, explain why. If it isn’t, give an interpretation under which it is false.
Answer
It’s not. Think of the interpretation where Q(x) is “x is even”, R(x) is “x is odd” and x ranges over the integers. Then ∃xQ(x) ∧ ∃xR(x) is true because ∃xQ(x) is true (there is an even integer) and ∃xR(x) is true (there is an odd integer). But ∃x(Q(x) ∧ R(x)) is false (there does not exist an integer that is both even and odd). So the statement (∃xQ(x) ∧ ∃xR(x)) → ∃x(Q(x) ∧ R(x)) is false under this interpretation and the sentence is not valid.
In predicate logic, does ∧ simply mean 'and' rather than intersection?
In predicate logic the connectives are the same of propositional logic :
It is intersection (between sets) that is defined with "and" :
The antecedent of the formula reads :
while the consequent reads :