not and

Show Summary Details

Quick Reference

If p and q are statements then ‘p not and q’, denoted by pq, is true unless both p and q are true. Since ‘not and’ is cumbersome language, this is often referred to as nand in logic. The truth table is as follows:

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.