# Can problems of class P be transformed into SAT formula?

I know that NP problems can be transformed into SAT (due to this fact, SAT is considered to be a NP Complete problem). I am not sure if P problems can too be transformed into SAT.

## migrated from ai.stackexchange.comMar 3 at 23:18

This question came from our site for people interested in conceptual questions about life and challenges in a world where "cognitive" functions can be mimicked in purely digital environment.

Yes, they can since $$P \subseteq NP$$.
• Exercise: Does $NP \subseteq P$ hold? – KVN Mar 4 at 0:23