Satisfiable Formula

logic

Definition

Satisfiable Formula

A formula is satisfiable if there exists at least one model under which it is true.

Formally, a formula $F$ is satisfiable if

$$\exists v(v(F)=1)$$

In that case, $v$ is a model of $F$.

Equivalently, a formula is satisfiable exactly when it is not a contradiction.