Satisfiable

A formula $F$ is satisfiable if there is an interpretation $v$ that makes the formula $F$ true. We say $v$ satisfies $F$.

$p$	$\neg p$
T	F
F	T

A set $S=\{A_1,...,A_n\}$ of propositional formulae is satisfiable if there is an interpretation $v$ satisfying every formula in $S$.