In: Advanced Math
Consider the formula
A : ∃x.[(∀y.P(x, y) → R(x)) → ¬∃z.Q(x, z)]
(a) Find a formula equivalent to A that only has negation symbols in front of basic formulas.
(b) Give an example of an interpretation where A is true. The domain should be the set N.
(c) Give an example of an interpretation where A is false. The domain should be the set N.
in the part a i am use the concept of double negation and then proved in part b and C only ask for example therefore I am give only example