Predicate logic compare

25 Views Asked by At

Heading ##I'm searching for references(text, videos, etc) on how to solve problems like this one.

Have just been working with how to rewriting expressions so they don't include $¬$ but, as you might understand I'm quite new to this and find it a bit challenging(not even sure what to search for that's why I'm here). I know that it should end up like "Both expressions are logically equivalent, meaning that a is prime." But I want to understand why that is.

Problem:

Throughout this task, the basis for all elements is $\mathbb{N}' \{1,2,3…n\}$

For which '$a$' are the following precepts true:

$P(a)=∀b∀c |(b=1)∨(c=1)∨¬(a=bc)$
and $Q(a)=¬∃b∃c |(b>1)∧(c>1)∧(a=bc)$

Thankful for all tips and on how to solve something like this, or information about the topic in general.

Regards, Petter