Question

Let the domain under consideration consist of all positive integers greater than 2. Define the following predicates: P(x) = x is a prime, Q(x) =x is an odd number. Then state the following compound propositions in a logic form and prove that they are logically equivalent using DeMorgan's laws for quantified statements.

A) There exists x such that x is not a prime or x is an odd number

B)Not for all x, x is a prime and x is not odd

*I'm really having trouble with this. I would really appreciate a fully written out solution

Answer 1