File:Logical connectives table.svg

These are the truth value inputs, called "A" and "B".

This is one truth value output.

The truth function AND makes the following associations:

(0,0)--->0

(1,0)--->0

(0,1)--->0

(1,1)--->1

In this line you see the law of contraposition

${\displaystyle (A\rightarrow B)\Leftrightarrow (\neg A\leftarrow \neg B)}$

In this line you see the De Morgan's law

${\displaystyle \neg (A\vee B)\Leftrightarrow (\neg A\wedge \neg B)}$

In this line you see the De Morgan's law

${\displaystyle \neg (A\wedge B)\Leftrightarrow (\neg A\vee \neg B)}$