If p and q are statements, then ‘p not or q’, denoted by p ↓ q, is true only when both p and q are false. Since ‘not or’ is cumbersome language, this is often referred to as ‘nor’ in logic. The truth table is as follows: